On Finding Minimal Two-Connected Subgraphs

DOI10.1006/JAGM.1995.1001MaRDI QIDQ4327813zbMATH OpenOpenAlexFDO

Authors Pierre Kelsen, Vijaya Ramachandran

Publication date 9 April 1995

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/219c137b03044813e1a73594c89ac4a419267721

zbMATH Keywords

efficient parallel algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 742959
• Biconnectivity approximations and graph carvings
• Computing Minimal Spanning Subgraphs in Linear Time
• Finding 2-edge connected spanning subgraphs.
• Approximating biconnectivity in parallel

Cited in

(7)

• On finding two-connected subgraphs in planar graphs
• More routes for evacuation
• Finding a Smallest Augmentation to Biconnect a Graph
• scientific article; zbMATH DE number 742959 (Why is no real title available?)
• Computing Minimal Spanning Subgraphs in Linear Time
• Finding Minors in Graphs with a Given Path Structure
• Towards more precise parallel biconnectivity approximation

This page was built for publication: On Finding Minimal Two-Connected Subgraphs

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