CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS

DOI10.1142/S1469026809002552MaRDI QIDQ5325617zbMATH OpenFDO

Authors Dan Mazzella, Henry Selvaraj, Laxmi P. Gewali

Publication date 10 August 2009

Published in International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1469026809002552

zbMATH Keywords

disjoint pathsnarrow corridorpath pair

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3946171
• scientific article; zbMATH DE number 4089593
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• Disjoint paths in sparse graphs
• scientific article; zbMATH DE number 4110723
• Tight paths in convex geometric hypergraphs
• Disjoint paths in graphs
• Edge-disjoint paths in planar graphs with constant congestion
• Edge-disjoint paths in planar graphs with constant congestion

Cites work

• A note on two problems in connexion with graphs
• Introduction to algorithms
• Output-sensitive reporting of disjoint paths

Cited in

(5)

• Connectivity and constructive algorithms of disjoint paths in dragonfly networks
• Constructing pairwise disjoint paths with few links
• scientific article; zbMATH DE number 4110723 (Why is no real title available?)
• Constructing pairwise disjoint paths with few links
• Tight paths in convex geometric hypergraphs

This page was built for publication: CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS

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