scientific article; zbMATH DE number 1303037

zbMATH Open0947.68116MaRDI QIDQ4249538FDOQ4249538

Authors: Hiroshi Nagamochi, Toru Hasunuma 

Publication date: 17 June 1999

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

Recommendations

• An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
• A faster parallel algorithm for \(k\)-connectivity
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Connectivity (05C40)

Cited In (3)

• An efficient \({\mathcal {NC}}\) algorithm for a sparse \(k\)-edge-connectivity certificate
• Sparse graph certificates for mixed connectivity
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity

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