Minimum cost nowhere-zero flows and cut-balanced orientations
From MaRDI portal
Cites work
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A combinatorial strongly polynomial algorithm for minimizing submodular functions
- A Contribution to the Theory of Chromatic Polynomials
- A Minimax Theorem for Directed Graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Approximately packing Dijoins via nowhere-zero flows
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Approximation Algorithms for Some Postman Problems
- Balanced Valuations and Flows in Multigraphs
- Combined connectivity augmentation and orientation problems
- Connections in combinatorial optimization
- Directed Network Design with Orientation Constraints
- Flows and generalized coloring theorems in graphs
- scientific article; zbMATH DE number 446490 (Why is no real title available?)
- scientific article; zbMATH DE number 3871059 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 3508211 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1305467 (Why is no real title available?)
- scientific article; zbMATH DE number 1943822 (Why is no real title available?)
- Hypothetical complexity of the nowhere-zero 5-flow problem
- Integer flows
- Matching, Euler tours and the Chinese postman
- Maximum flow and minimum-cost flow in almost-linear time
- Nowhere-zero 6-flows
- On (k,d)-colorings and fractional nowhere-zero flows
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- On the algebraic theory of graph colorings
- On the complexity of edge traversing
- On the mixed Chinese postman problem
- On the windy postman problem on Eulerian graphs
- Recent results on well-balanced orientations
- Steiner forest orientation problems
- The Chinese Postman Problem for Mixed Networks
- The ellipsoid method and its consequences in combinatorial optimization
- The mixed postman problem
- The NP-Completeness of Edge-Coloring
- The weak 3-flow conjecture and the weak circular flow conjecture
- Well-balanced orientations of mixed graphs
This page was built for publication: Minimum cost nowhere-zero flows and cut-balanced orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346481)
