Computing disjoint paths with length constraints

DOI10.1007/3-540-62559-3_30MaRDI QIDQ6550560zbMATH OpenFDO

Authors S. Tragoudas, Yaakov Varol

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62559-3_30

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The disjoint shortest paths problem
• Heuristics for finding a maximum number of disjoint bounded paths
• The complexity of finding two disjoint paths with min-max objective function
• Finding disjoint paths with different path-costs: Complexity and algorithms
• The undirected two disjoint shortest paths problem

Cites work

• A quick method for finding shortest pairs of disjoint paths
• Disjoint paths in a network
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(1)

• Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

This page was built for publication: Computing disjoint paths with length constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550560)