Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width

DOI10.1007/978-3-642-13562-0_26zbMath1284.68280OpenAlexW1575418443MaRDI QIDQ3569083

Daniel Meister, Pinar Heggernes, Udi Rotics

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Clique-width of full bubble model graphs

This page was built for publication: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width