Abstract
Vertex and edge connectivity are special cases of mixed connectivity, in which all edges and a specified set of vertices play a similar role. Certificates of k-connectivity for a graph are obtained by renmving a subset of its edges, while preserving its connectivity up to k. We unify the previous work on connectivity certificates and extend it to handle mixed connectivity and multigraphs. Our treatment contributes a new insight of the pertinent structures, yielding more general results and simpler proofs. Also, we present a communication-optimal distributed algorithm for finding mixed connectivity certificates.
Cite
CITATION STYLE
Even, S., Itkis, G., & Rajsbaum, S. (1995). On mixed connectivity certificates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 979, pp. 1–16). Springer Verlag. https://doi.org/10.1007/3-540-60313-1_130
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
