Pfaffian orientations 0-1 permanents, and even cycles in directed graphs
Discrete Applied Mathematics - Combinatorics and complexity
On-line maintenance of the four-components of a graph (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Permanents, Pfaffian orientations, and even directed circuits (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient union-find for planar graphs and other sparse graph classes
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Fast algorithms for k-shredders and k-node connectivity augmentation
Journal of Algorithms
Using expander graphs to find vertex connectivity
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.01 |
A shredder in an undirected graph is a set of vertices whose removal results in at least three components. A 3-shredder is a shredder of size three. We present an algorithm that, given a 3-connected graph, finds its 3-shredders in time proportional to the number of vertices and edges, when implemented on a RAM (random access machine).