Publication:4942616
From MaRDI portal
zbMath0941.05515MaRDI QIDQ4942616
Hans L. Bodlaender, Klaus Jansen
Publication date: 16 March 2000
chordal graphs; cographs; NP-complete; split graphs; polynomial time; max-cut problem; tripartite graph; undirected path graphs; complement of a bipartite graph
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
