Finding Large Clique Minors is Hard
From MaRDI portal
Publication:3184610
DOI10.7155/jgaa.00183zbMath1194.68122OpenAlexW1974059398MaRDI QIDQ3184610
Publication date: 21 October 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00183
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
On the computational complexity of the virtual network embedding problem ⋮ Increasing the minimum degree of a graph by contractions ⋮ Hadwiger Number of Graphs with Small Chordality ⋮ Contracting to a longest path in H-free graphs ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Lower bounds for treewidth of product graphs ⋮ Connected matchings in chordal bipartite graphs
This page was built for publication: Finding Large Clique Minors is Hard
