The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph

Authors:
Yefim Dinitz
Affiliations:
-
Venue:
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1992

A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Planarity of the 2-Level Cactus Model

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

Hi-index	0.01