Towards more precise parallel biconnectivity approximation

DOI10.1007/BFB0009498MaRDI QIDQ6487442zbMATH OpenFDO

Authors Ka Wong Chong, Tak-Wah Lam

Publication date 25 January 2023

Full work available at URL https://doi.org/10.1007/BFB0009498

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 871896
• Approximating biconnectivity in parallel
• scientific article; zbMATH DE number 1760036
• Approximating unweighted connectivity problems in parallel
• scientific article; zbMATH DE number 1104333

Cites work

• Approximating matchings in parallel
• Biconnectivity approximations and graph carvings
• Finding Connected Components in O(log n log log n) Time on the EREW PRAM
• scientific article; zbMATH DE number 437534 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• scientific article; zbMATH DE number 871896 (Why is no real title available?)
• On Finding Minimal Two-Connected Subgraphs

Cited in

(8)

• A data structure for bicategories, with application to speeding up an approximation algorithm
• Approximating biconnectivity in parallel
• Approximating unweighted connectivity problems in parallel
• scientific article; zbMATH DE number 4150228 (Why is no real title available?)
• An Efficient Parallel Biconnectivity Algorithm
• scientific article; zbMATH DE number 1104333 (Why is no real title available?)
• Simpler and faster biconnectivity augmentation
• scientific article; zbMATH DE number 871896 (Why is no real title available?)

This page was built for publication: Towards more precise parallel biconnectivity approximation

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