Sciweavers

Share
SPAA
2005
ACM

Peer-to-peer networks based on random transformations of connected regular undirected graphs

12 years 7 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached
Peter Mahlmann, Christian Schindelhauer
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where SPAA
Authors Peter Mahlmann, Christian Schindelhauer
Comments (0)
books