Reducing edge connectivity to vertex connectivity
ACM SIGACT News
Perfectly secure message transmission
Journal of the ACM (JACM)
A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
IEEE Transactions on Parallel and Distributed Systems
From Algorithms to Working Programs: On the Use of Program Checking in LEDA
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On-Line Graph Algorithms with SPQR-Trees
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Computing ears and branchings in parallel
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Graph Theory
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Progress on certifying algorithms
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Computer Science Review
| Hi-index | 0.00 |
One of the most noted construction methods of 3-vertex-connected graphs is due to Tutte and based on the following fact: Every 3-vertex-connected graph G on more than 4 vertices contains a contractible edge, i. e., an edge whose contraction generates a 3-connected graph. This implies the existence of a sequence of edge contractions from G to K4 such that every intermediate graph is 3-vertex-connected. A theorem of Barnette and Grünbaum yields a similar sequence using removals of edges instead of contractions. We show how to compute both sequences in optimal time, improving the previously best known running times of O(|V|2) to O(|E|). Based on this result, we give a linear-time test of 3-connectivity that is certifying; finding such an algorithm has been a major open problem in the design of certifying algorithms in the last years. The 3-connectivity test is conceptually different from well-known linear-time tests of 3-connectivity; it uses a certificate that is easy to verify in time O(|E|). We also provide an optimal certifying test of 3-edge-connectivity.