A note on the recognition of nested graphs

DOI10.1007/978-3-642-02029-2_4MaRDI QIDQ3655137zbMATH OpenOpenAlexFDO

Authors Mark Korenblit, Vadim E. Levit

Publication date 7 January 2010

Published in Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02029-2_4

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Nested Graphs
• Minimal cuts in two-terminal directed acyclic graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Algorithms for interval catch digraphs
• scientific article; zbMATH DE number 3896983

Cites work

• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Forbidden subgraphs and graph decomposition
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• scientific article; zbMATH DE number 2040952 (Why is no real title available?)
• scientific article; zbMATH DE number 795224 (Why is no real title available?)
• Minimal cuts in two-terminal directed acyclic graphs
• Nested Graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• The Recognition of Series Parallel Digraphs

Cited in

(3)

• Nested Graphs
• Minimal cuts in two-terminal directed acyclic graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs

This page was built for publication: A note on the recognition of nested graphs

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