FindingH-partitions efficiently
From MaRDI portal
Publication:4680731
DOI10.1051/ita:2005008zbMath1063.05124MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Covering Graphs with Few Complete Bipartite Subgraphs, The polynomial dichotomy for three nonempty part sandwich problems, The polynomial dichotomy for three nonempty part sandwich problems, Obstructions to partitions of chordal graphs, The complexity of surjective homomorphism problems-a survey, The external constraint 4 nonempty part sandwich problem, Parameterizing cut sets in a graph by the number of their components, Computing vertex-surjective homomorphisms to partially reflexive trees, \(2K_{2}\) vertex-set partition into nonempty parts, Covering graphs with few complete bipartite subgraphs, \(2K_2\)-partition of some classes of graphs, The P versus NP-complete dichotomy of some challenging problems in graph theory, Disconnected cuts in claw-free graphs, The computational complexity of disconnected cut and \(2 K_2\)-partition, On disconnected cuts and separators, Graph partitions with prescribed patterns, Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees, On the structure of self-complementary graphs, 2K2-Partition Problem, Matrix Partitions with Finitely Many Obstructions, 2K2 vertex-set partition into nonempty parts
Cites Work
