On mixed connectivity certificates
type: Item
instance of: scholarly article
title: On mixed connectivity certificates
zbMATH Open document ID: 0913.68147
DOI: 10.1016/S0304-3975(98)00023-1
author: Shimon Even
author: Gene Itkis
author: Sergio Rajsbaum
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 1238345
zbMATH Keywords: connectivity certificates
zbMATH Keywords: mixed connectivity
zbMATH Keywords: distributed algorithm
MaRDI profile type: Publication
cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
cites work: Q3236250
cites work: Q4230327
cites work: On sparse subgraphs preserving connectivity properties
cites work: Q4198056
cites work: The multi-tree approach to reliability in distributed networks
cites work: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
cites work: Grad und lokaler Zusammenhang in endlichen Graphen
cites work: Q4189309
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Sub-linear distributed algorithms for sparse certificates and biconnected components
cites work: Q5615283
description: scientific article; zbMATH DE number 1238345