« Back to Record
Citation APA

Dujmović, V. V., Harvey, D., Joret, G., Reed, B., & Wood, D. (2013). A linear-time algorithm for finding a complete graph minor in a dense graph. SIAM journal on discrete mathematics, 27(4), 1770--1774. doi:10.1137/120866725


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/172700

Dujmović, V. V., Harvey, D., Joret, G., Reed, B., & Wood, D. (2013). A linear-time algorithm for finding a complete graph minor in a dense graph. SIAM journal on discrete mathematics, 27(4), 1770--1774. doi:10.1137/120866725