On flows in simple bidirected and skew-symmetric networks
From MaRDI portal
(Redirected from Publication:415697)
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
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1775390 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A polynomial algorithm for b-matchings: An alternative approach
- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
- Antisymmetrical Digraphs
- Beyond the flow decomposition barrier
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Free multiflows in bidirected and skew-symmetric graphs
- Maximum skew-symmetric flows and matchings
- Network Flow and Testing Graph Connectivity
- Path problems in skew-symmetric graphs
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)