scientific article; zbMATH DE number 871896

MaRDI QIDQ4875165zbMATH OpenFDO

Authors Ka Wong Chong, Tak-Wah Lam

Publication date 28 April 1996

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Towards more precise parallel biconnectivity approximation
• Approximating biconnectivity in parallel
• scientific article; zbMATH DE number 437534
• Biconnectivity approximations and graph carvings

Cited in

(7)

• 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 437534 (Why is no real title available?)
• Simpler and faster biconnectivity augmentation
• Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
• Towards more precise parallel biconnectivity approximation

This page was built for publication:

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