Acyclic k-connected subgraphs for distributed alternate routing in communications networks

DOI10.1016/0166-218X(88)90092-3zbMath0663.94023MaRDI QIDQ1115406

Moshe Segal

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

node-disjoint pathslinear-time algorithmacyclic spanning subgraphdistributed routing control

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• A quick method for finding shortest pairs of disjoint paths
• Disjoint paths in a network
• An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
• Network Flow and Testing Graph Connectivity
• Dividing a Graph into Triconnected Components
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Acyclic k-connected subgraphs for distributed alternate routing in communications networks