Constructing disjoint paths for secure communication

DOI10.1007/B13831MaRDI QIDQ5897407zbMATH OpenOpenAlexFDO

Authors Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13831

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Secure communication in multicast graphs
• scientific article; zbMATH DE number 1003293
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• scientific article; zbMATH DE number 871922
• Finding paths with minimum shared edges

Cited in

(2)

• Short length Menger's theorem and reliable optical routing
• Approximate duality of multicommodity multiroute flows and cuts: single source case

This page was built for publication: Constructing disjoint paths for secure communication

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