Sciweavers

SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
13 years 10 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh