On mixed connectivity certificates

DOI10.1007/3-540-60313-1_130zbMath1512.68213OpenAlexW4205259366MaRDI QIDQ6102287

Shimon Even, Gene Itkis, Sergio Rajsbaum

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_130

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Grad und lokaler Zusammenhang in endlichen Graphen
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• On sparse subgraphs preserving connectivity properties

This page was built for publication: On mixed connectivity certificates