Maximum skew-symmetric flows
From MaRDI portal
Publication:6102298
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 1003285 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 177842 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A Faster Deterministic Maximum Flow Algorithm
- A new approach to the maximum-flow problem
- Faster scaling algorithms for general graph matching problems
- Finding Minimum-Cost Circulations by Successive Approximation
- Improved Time Bounds for the Maximum Flow Problem
- Matching theory
- Network Flow and Testing Graph Connectivity
- Paths, Trees, and Flowers
- Self-adjusting binary search trees
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(5)- Mutual exclusion scheduling with interval graphs or related classes. I
- Linear time parameterized algorithms via skew-symmetric multicuts
- Maximum skew-symmetric flows and matchings
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Making bidirected graphs strongly connected
This page was built for publication: Maximum skew-symmetric flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102298)