Visualizing, finding and packing dijoins

MaRDI QIDQ5717957zbMATH OpenFDO

Authors F. Bruce Shepherd, Adrian Vetta

Publication date 13 January 2006

zbMATH Keywords

algorithmsdirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On dijoins
• Fractional Packing ofT-Joins
• Disjoint dijoins
• Disjoint dijoins for classes of dicuts in finite and infinite digraphs
• Covering directed and odd cuts

Cited in

(9)

• Disjoint dijoins
• Single-Sink Multicommodity Flow with Side Constraints
• Disjoint dijoins for classes of dicuts in finite and infinite digraphs
• On Packing Dijoins in Digraphs and Weighted Digraphs
• Strong orientation of a connected graph for a crossing family
• Approximately packing Dijoins via nowhere-zero flows
• A min-max relation on dicuts and dijoins in weighted chordal digraphs
• Finding small dijoins in transitive closure time
• An algorithm for minimum cost arc-connectivity orientations

This page was built for publication: Visualizing, finding and packing dijoins

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