Reconstructing edge-disjoint paths.

DOI10.1016/S0167-6377(03)00022-1MaRDI QIDQ1413914zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 17 November 2003

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(03)00022-1

zbMATH Keywords

flow equivalent treestable matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Reconstructing edge-disjoint paths faster
• scientific article; zbMATH DE number 2079393
• Edge-disjoint paths revisited
• Reconstruction of the path graph
• scientific article; zbMATH DE number 2188351
• scientific article; zbMATH DE number 4077273
• Disjoint paths in graphs. (Reprint)
• Graph-Theoretic Concepts in Computer Science
• Edge-disjoint paths in planar graphs
• scientific article; zbMATH DE number 4208112

Cites work

• College Admissions and the Stability of Marriage
• Computing on a free tree via complexity-preserving mappings
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 1775390 (Why is no real title available?)
• Multi-Terminal Network Flows
• Network flows. Theory, algorithms, and applications.

Cited in

(3)

• Reconstructing edge-disjoint paths faster
• Characterizing the flow equivalent trees of a network
• Algorithms and Computation

This page was built for publication: Reconstructing edge-disjoint paths.

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