Why should biconnected components be identified first

DOI10.1016/0166-218X(93)90046-QzbMath0789.90084MaRDI QIDQ1803675

Dorit S. Hochbaum

Publication date: 29 June 1993

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

zbMATH Keywords

biconnected componentsdecomposition procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Finding biconnected components in O(n) time for a class of graphs ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Efficient reassembling of three-regular planar graphs ⋮ A two-level graph partitioning problem arising in mobile wireless communications

Cites Work

• Unnamed Item
• Efficient bounds for the stable set, vertex cover and set packing problems

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