Reconstructing edge-disjoint paths.

DOI10.1016/S0167-6377(03)00022-1zbMath1041.90060OpenAlexW1978207220MaRDI QIDQ1413914

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

stable matchingflow equivalent tree

Mathematics Subject Classification ID

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

Related Items (2)

Reconstructing edge-disjoint paths faster ⋮ Characterizing the flow equivalent trees of a network

Cites Work

• Computing on a free tree via complexity-preserving mappings
• Multi-Terminal Network Flows
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item
• Unnamed Item

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