Publication:4228454
From MaRDI portal
zbMath0922.68089MaRDI QIDQ4228454
Publication date: 4 October 1999
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Graph connectivity and its augmentation: Applications of MA orderings, Random sampling and greedy sparsification for matroid optimization problems, Cardinality constrained minimum cut problems: complexity and algorithms., A clustering algorithm based on graph connectivity, On the number of small cut in a graph, Minimum Cuts of Simple Graphs in Almost Always Linear Time