On the maximum disjoint paths problem on edge-colored graphs
DOI10.1016/J.DISOPT.2012.01.002zbMATH Open1242.90281OpenAlexW3104897947MaRDI QIDQ435732FDOQ435732
Authors: Bang Ye Wu 
Publication date: 12 July 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.01.002
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Graph minors. XIII: The disjoint paths problem
- A simplified NP-complete satisfiability problem
- On the complexity of vertex-disjoint length-restricted path problems
- Title not available (Why is that?)
- The complexity of finding maximum disjoint paths with length constraints
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Approximation algorithms and hardness results for labeled connectivity problems
- Combinatorial Gray Codes
- Length-bounded cuts and flows
- Solving the 2-disjoint paths problem in nearly linear time
- Properly coloured cycles and paths: Results and open problems
Cited In (8)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability
- Exact approaches for the orderly colored longest path problem: performance comparison
- Parallel connectivity in edge-colored complete graphs: complexity results
- On the edge capacitated Steiner tree problem
- Path problems in generalized stars, complete graphs, and brick wall graphs
- Title not available (Why is that?)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
This page was built for publication: On the maximum disjoint paths problem on edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435732)
