Computing Edge-Connectivity in Multiple and Capacitated Graphs

Abstract

I . Introduction In this paper, a graph G=(V,E) stands for an undirected multiple graph that s a t i s f i e s IVi ~ 2 . Note t h a t i t may have m u l t i p l e edges but has no s e l f l o o p , u n l e s s o t h e r w i s e s p e c i f i e d . Let X (G) denote the e d g e c o n n e C t i v i t y of G. We c o n s i d e r the problem of computing ~ (G) f… (More)
DOI: 10.1007/3-540-52921-7_51

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics