Two-Commodity Flow
From MaRDI portal
Cited in
(29)- On unicyclic graphs with uniquely restricted maximum matchings
- Hardness results for structured linear systems
- Partitioning trees: Matching, domination, and maximum diameter
- An exponential (matching based) neighborhood for the vehicle routing problem
- The complexity of bottleneck labeled graph problems
- A new strategy for the undirected two-commodity maximum flow problem
- On the hardness of finding near-optimal multicuts in directed acyclic graphs
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Bottleneck subset-type restricted matching problems
- Max-balanced flows in oriented matroids
- Computing the throughput of a network with dedicated lines
- The Maximum Flow Problem for Oriented Flows
- Synthesis of directed multicommodity flow networks
- Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- The complexity of linear programming
- Simple and improved parameterized algorithms for multiterminal cuts
- Performing Multicut on Walkable Environments
- The biobjective undirected two-commodity minimum cost flow problem
- Algorithms and complexity analysis for some flow problems
- NP-Complete operations research problems and approximation algorithms
- Integral biflow maximization
- Problems hard for treewidth but easy for stable gonality
- A Representation of bipartite graphs by digraphs and its programming application
- High-accuracy multicommodity flows via iterative refinement
- A constrained matching problem
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Multicommodity flows in tree-like networks
- Quadratic vertex kernel for rainbow matching
This page was built for publication: Two-Commodity Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170247)
