A linear-time algorithm for finding a complete graph minor in a dense graph

Research output: Contribution to journal › Article › Research › peer-review

3 Citations (Scopus)

Original language	English
Pages (from-to)	1770 - 1774
Number of pages	5
Journal	SIAM Journal on Discrete Mathematics
Volume	27
Issue number	4
DOIs	https://doi.org/10.1137/120866725
Publication status	Published - 2013

Access to Document

@article{eb703dd93ac44d959caecca9e14d22ac,

title = "A linear-time algorithm for finding a complete graph minor in a dense graph",

author = "Vida Dujmovic and Daniel Harvey and Gwenael Joret and Reed, \{Bruce A\} and David Wood",

year = "2013",

doi = "10.1137/120866725",

language = "English",

volume = "27",

pages = "1770 -- 1774",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial \& Applied Mathematics (SIAM)",

number = "4",

}

TY - JOUR

T1 - A linear-time algorithm for finding a complete graph minor in a dense graph

AU - Dujmovic, Vida

AU - Harvey, Daniel

AU - Joret, Gwenael

AU - Reed, Bruce A

AU - Wood, David

PY - 2013

Y1 - 2013

U2 - 10.1137/120866725

DO - 10.1137/120866725

M3 - Article

SN - 0895-4801

VL - 27

SP - 1770

EP - 1774

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 4

ER -