scientific article; zbMATH DE number 1979724

MaRDI QIDQ4428101zbMATH OpenFDO

Authors Wanling Qu, Chongyi Yuan

Publication date 14 September 2003

zbMATH Keywords

\(k\)-edge connectivity augmentation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1760036
• Approximating biconnectivity in parallel
• Parallel and fast sequential algorithms for undirected edge connectivity augmentation
• Approximation algorithms for graph augmentation
• An 0(log n) parallel algorithm for strong connectivity augmentation problem

Cited in

(3)

• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• scientific article; zbMATH DE number 1555967 (Why is no real title available?)
• Approximation algorithms for graph augmentation

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 Q4428101)