Pages that link to "Item:Q1885276"
From MaRDI portal
The following pages link to Maximum skew-symmetric flows and matchings (Q1885276):
Displayed 11 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)