Publication:3140458
From MaRDI portal
zbMath0801.68140MaRDI QIDQ3140458
Publication date: 15 December 1993
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, A linear time algorithm for computing 3-edge-connected components in a multigraph, Greedy splitting algorithms for approximating multiway partition problems, Minimum Cuts of Simple Graphs in Almost Always Linear Time