Open AccessFinding Large Clique Minors is Hard
Author(s) -
David Eppstein
Publication year - 2009
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00183
Subject(s) - clique , combinatorics , mathematics , computer science
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom