FindingH-partitions efficiently
From MaRDI portal
Publication:4680731
DOI10.1051/ita:2005008zbMath1063.05124OpenAlexW2152728086MaRDI QIDQ4680731
Sulamita Klein, Simone Dantas, Sylvain Gravier, Celina M. Herrera de Figueiredo
Publication date: 7 June 2005
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_133_0
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (22)
Obstructions to partitions of chordal graphs ⋮ Disconnected cuts in claw-free graphs ⋮ 2K2 vertex-set partition into nonempty parts ⋮ Unnamed Item ⋮ The complexity of surjective homomorphism problems-a survey ⋮ Parameterizing cut sets in a graph by the number of their components ⋮ Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees ⋮ The polynomial dichotomy for three nonempty part sandwich problems ⋮ The polynomial dichotomy for three nonempty part sandwich problems ⋮ The external constraint 4 nonempty part sandwich problem ⋮ \(2K_2\)-partition of some classes of graphs ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ \(2K_{2}\) vertex-set partition into nonempty parts ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Computing vertex-surjective homomorphisms to partially reflexive trees ⋮ On disconnected cuts and separators ⋮ Graph partitions with prescribed patterns ⋮ Covering Graphs with Few Complete Bipartite Subgraphs ⋮ Covering graphs with few complete bipartite subgraphs ⋮ On the structure of self-complementary graphs ⋮ 2K2-Partition Problem ⋮ Matrix Partitions with Finitely Many Obstructions
Cites Work
This page was built for publication: FindingH-partitions efficiently
