scientific article; zbMATH DE number 1753166

MaRDI QIDQ4533374zbMATH OpenFDO

Authors Elias Dahlhaus, Jens Gustedt, R. M. McConnell

Publication date 26 September 2002

Full work available at URL https://eudml.org/doc/122068

zbMATH Keywords

data structuresmodular decompositionefficient graph algorithmssearch strategies

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1086495
• Simple DFS on the complement of a graph and on partially complemented digraphs
• scientific article; zbMATH DE number 1003286
• Digraph Decompositions and Eulerian Systems
• Modular decomposition and transitive orientation

Cited in

(8)

• A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
• A general label search to investigate classical graph search algorithms
• On the power of graph searching for cocomparability graphs
• Speeding up Graph Algorithms via Switching Classes
• Linear-time modular decomposition of directed graphs
• Simple DFS on the complement of a graph and on partially complemented digraphs
• On the parallel computation of the biconnected and strongly connected co-components of graphs
• On the Strongly Connected and Biconnected Components of the Complement of Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533374)