Minimal cuts in two-terminal directed acyclic graphs

zbMATH Open1163.05029MaRDI QIDQ3615909FDOQ3615909

Authors: Mark Korenblit, Vadim E. Levit 

Publication date: 24 March 2009

Recommendations

• Nested Graphs
• A note on the recognition of nested graphs
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Extracting maximal information about sets of minimum cuts
• Tight lower bounds for the number of inclusion-minimal \(st\)-cuts

zbMATH Keywords

reductionseries-parallel graphtwo-terminal directed acyclic graphminimal cut

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cited In (8)

• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
• Minimal 2-connected graphs satisfying the even cut condition
• Nested Graphs
• On mergings in acyclic directed graphs
• A note on the recognition of nested graphs

This page was built for publication: Minimal cuts in two-terminal directed acyclic graphs

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