Minimum mean cycle problem in bidirected and skew-symmetric graphs

DOI10.1016/j.disopt.2008.09.005zbMath1161.05327arXivmath/0608443OpenAlexW2086432678MaRDI QIDQ1013299

Maxim A. Babenko, Alexander V. Karzanov

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608443

zbMATH Keywords

bidirected graphminimum mean cycleskew-symmetric graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Shortest Paths in Nearly Conservative Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A characterization of the minimum cycle mean in a digraph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximum skew-symmetric flows and matchings
• Free multiflows in bidirected and skew-symmetric graphs
• Path problems in skew-symmetric graphs
• Reducing Matching to Polynomial Size Linear Programming
• Antisymmetrical Digraphs

This page was built for publication: Minimum mean cycle problem in bidirected and skew-symmetric graphs