Maximum skew-symmetric flows and matchings
From MaRDI portal
Publication:1885276
DOI10.1007/s10107-004-0505-zzbMath1070.90090arXivmath/0304290MaRDI QIDQ1885276
Alexander V. Karzanov, Andrew V. Goldberg
Publication date: 28 October 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304290
90C10: Integer programming
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach, On flows in simple bidirected and skew-symmetric networks, A simple reduction from maximum weight matching to maximum cardinality matching, Greedy matching: guarantees and limitations, Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization, A cubic kernel for feedback vertex set and loop cutset, Minimum mean cycle problem in bidirected and skew-symmetric graphs, Min-cost multiflows in node-capacitated undirected networks, Free multiflows in bidirected and skew-symmetric graphs, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, Linear-Time Approximation for Maximum Weight Matching
