On flows in simple bidirected and skew-symmetric networks

DOI10.1134/S0032946006040089zbMath1237.90052OpenAlexW1982056843MaRDI QIDQ415697

Maxim A. Babenko

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946006040089

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial algorithm for b-matchings: An alternative approach
• 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
• Beyond the flow decomposition barrier
• Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
• Network Flow and Testing Graph Connectivity
• Antisymmetrical Digraphs

This page was built for publication: On flows in simple bidirected and skew-symmetric networks