𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut Size Statistics of Graph Bisection Heuristics

✍ Scribed by Schreiber, G. R.; Martin, O. C.

Book ID
118205203
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
404 KB
Volume
10
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

3-connected graphs with non-cut contract
3-connected graphs with non-cut contractible edge covers of size k
✍ Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 493 KB πŸ‘ 1 views

## Abstract In this paper, we show that if a 3‐connected graph __G__ other than __K__~4~ has a vertex subset __K__ that covers the set of contractible edges of __G__ and if |__K__| 3 and |__V(G)__| 3|__K__| βˆ’ 1, then __K__ is a cutset of __G__. We also give examples to show that this result is best