Maximum skew-symmetric flows and matchings

2004/03/10 by Andrew V. Goldberg, Alexander V. Karzanov · 61 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Flow (mathematics) #Flow network #Matching (statistics) #Mathematics #Maximum flow problem #Optimization and Search Problems #Path (computing) #Skew #Upper and lower bounds

paper · doi:10.1007/s10107-004-0505-z

published in Mathematical Programming 100(3) (Springer Science and Business Media LLC)

crossref issued 2004/03/10 · crossref published 2004/03/10 · crossref published-online 2004/03/10 · openalex publication_date 2004/03/10 · crossref created 2004/06/22 · crossref published-print 2004/07/01 · crossref deposited 2019/05/29 · openalex created_date 2025/10/10 · crossref indexed 2026/06/09 · openalex updated_date 2026/07/23

Citations

• Matching: A Well-Solved Class of Integer Linear Programs
• An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
• A linear-time algorithm for a special case of disjoint set union
• Faster scaling algorithms for general graph matching problems
• Depth-First Search and Linear Graph Algorithms
• Combinatorial optimization: networks and matroids
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
• Path problems in skew-symmetric graphs

Cited by

• Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
• Skew-symmetric graph [wikipedia]