Pages that link to "Item:Q3960724"
From MaRDI portal
The following pages link to Min-max Relations for Directed Graphs (Q3960724):
Displayed 20 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
- On packing connectors (Q1272488) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Equitable partitions into matchings and coverings in mixed graphs (Q2237227) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- Proving total dual integrality with cross-free families—A general framework (Q3313630) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459) (← links)
- On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)