Min-max Relations for Directed Graphs
From MaRDI portal
Cited in
(21)- Directed cut transversal packing for source-sink connected graphs
- A Las Vegas RNC algorithm for maximum matching
- An efficient algorithm for minimum-weight bibranching
- On packing connectors
- Shortest bibranchings and valuated matroid intersection
- Relationship of two formulations for shortest bibranchings
- Complexity of packing common bases in matroids
- Equitable partitions into matchings and coverings in mixed graphs
- Efficient many-to-Many point matching in one dimension
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Stronger bounds and faster algorithms for packing in generalized kernel systems
- Proving total dual integrality with cross-free families—A general framework
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs
- On Packing Dijoins in Digraphs and Weighted Digraphs
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- An efficient scaling algorithm for the minimum weight bibranching problem
- A min-max relation on dicuts and dijoins in weighted chordal digraphs
- Packing and covering of crossing families of cuts
- A family of perfect graphs associated with directed graphs
- Partitioning series-parallel multigraphs into v^*-excluding edge covers
This page was built for publication: Min-max Relations for Directed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960724)
