A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks

zbMATH Open0917.68163MaRDI QIDQ1289166FDOQ1289166

Authors: K. Appert 

Publication date: 24 May 1999

Published in: Automation and Remote Control (Search for Journal in Brave)

Recommendations

• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• Topological optimization of the large-scale data transmission networks
• scientific article; zbMATH DE number 841627
• Generating 3-vertex connected spanning subgraphs
• Algorithms for designing optimized fixed broadband networks

zbMATH Keywords

biconnected spanning subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited In (4)

• Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity
• Title not available (Why is that?)
• Characterization of layer-2 unique topologies
• A modified algorithm of multiplex networks generation based on overlapped links

This page was built for publication: A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks

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