Pages that link to "Item:Q1885276"
From MaRDI portal
The following pages link to Maximum skew-symmetric flows and matchings (Q1885276):
Displayed 24 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)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q2169943) (← links)
- Making bidirected graphs strongly connected (Q2300723) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- (Q5091230) (← links)
- Faster algorithms for half-integral T -Path packing (Q5136223) (← links)
- Approximation algorithms for the directed path partition problems (Q6113908) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q6119828) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)