Why should biconnected components be identified first

DOI10.1016/0166-218X(93)90046-QzbMATH Open0789.90084MaRDI QIDQ1803675FDOQ1803675

Authors: Dorit S. Hochbaum 

Publication date: 29 June 1993

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

Recommendations

• An Efficient Parallel Biconnectivity Algorithm
• On the Strongly Connected and Biconnected Components of the Complement of Graphs
• The decomposition of graphs into \(k\)-connected components
• On the parallel computation of the biconnected and strongly connected co-components of graphs
• Graphs and graph algorithms

zbMATH Keywords

biconnected componentsdecomposition procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Efficient bounds for the stable set, vertex cover and set packing problems
• Title not available (Why is that?)

Cited In (5)

• A two-level graph partitioning problem arising in mobile wireless communications
• Finding biconnected components in O(n) time for a class of graphs
• The impact of a bi-connected graph decomposition on solving cooperative path-finding problems
• Efficient reassembling of three-regular planar graphs
• A heuristic approach for dividing graphs into bi-connected components with a size constraint

This page was built for publication: Why should biconnected components be identified first

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