scientific article; zbMATH DE number 871896

zbMATH Open0847.68076MaRDI QIDQ4875165FDOQ4875165

Authors: Ka Wong Chong, Tak-Wah Lam 

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (6)

• Title not available (Why is that?)
• Approximating unweighted connectivity problems in parallel
• Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
• A data structure for bicategories, with application to speeding up an approximation algorithm
• Simpler and faster biconnectivity augmentation
• 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)