Algorithm Theory - SWAT 2004

DOI10.1007/b98413zbMath1095.68622MaRDI QIDQ5315370

Fabien de Montgolfier, Christophe Paul, Michel A. Habib

Publication date: 7 September 2005

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

Full work available at URL: https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures

Related Items

An Analytic Propositional Proof System on Graphs, Cograph editing: Merging modules is equivalent to editing P_4s, Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory, Tight lower bounds on the number of bicliques in false-twin-free graphs, Autonomous sets for the hypergraph of all canonical covers, A survey of the algorithmic aspects of modular decomposition, A distance measure for large graphs based on prime graphs, Transitive orientations in bull-reducible Berge graphs, Minimal separators in \(P_4\)-sparse graphs, Almost every graph is divergent under the biclique operator, Partitioned probe comparability graphs, On probe permutation graphs, Algorithmic aspects of a general modular decomposition theory, An efficient exact algorithm for triangle listing in large graphs, Vertex removal in biclique graphs, From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats, Applying modular decomposition to parameterized cluster editing problems, Some results on more flexible versions of Graph Motif, Parameterized algorithms for edge biclique and related problems, The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes, A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs