On flows in simple bidirected and skew-symmetric networks
From MaRDI portal
Publication:415697
DOI10.1134/S0032946006040089zbMATH Open1237.90052OpenAlexW1982056843MaRDI QIDQ415697FDOQ415697
Authors: Maxim 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
Recommendations
- Flows on networks: recent results and perspectives
- Asymptotic behavior of flows in networks
- On flows in bidirected graphs
- scientific article; zbMATH DE number 1262804
- Flows in Undirected Unit Capacity Networks
- scientific article; zbMATH DE number 3174052
- Bi-flows on a network
- Asymptotic behaviour of flows on reducible networks
- Flows on networks and complicated domains
- Some sufficient conditions for the existence of nonhomogeneous flows in networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- Beyond the flow decomposition barrier
- Network Flow and Testing Graph Connectivity
- A polynomial algorithm for b-matchings: An alternative approach
- Title not available (Why is that?)
- Maximum skew-symmetric flows and matchings
- Free multiflows in bidirected and skew-symmetric graphs
- Path problems in skew-symmetric graphs
- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
- Title not available (Why is that?)
- Antisymmetrical Digraphs
Cited In (6)
This page was built for publication: On flows in simple bidirected and skew-symmetric networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415697)
