Nested Graphs

DOI10.1016/J.ENDM.2006.06.016MaRDI QIDQ3439418zbMATH OpenOpenAlexFDO

Authors Mark Korenblit, Vadim E. Levit

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.016

zbMATH Keywords

directed acyclic graphmincutseries-parallel graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• A note on the recognition of nested graphs
• Minimal cuts in two-terminal directed acyclic graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Extracting maximal information about sets of minimum cuts
• scientific article; zbMATH DE number 7378361

Cites work

• Computing Network Reliability in Time Polynomial in the Number of Cuts
• scientific article; zbMATH DE number 49666 (Why is no real title available?)
• scientific article; zbMATH DE number 795224 (Why is no real title available?)
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Topology of series-parallel networks

Cited in

(6)

• Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming
• Minimal cuts in two-terminal directed acyclic graphs
• A note on the recognition of nested graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Nested hierarchies in planar graphs
• Computational Science – ICCS 2005

This page was built for publication: Nested Graphs

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