Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

SPAA
2005
ACM

favoriteEmaildiscussreport

94views Distributed And Parallel Com...» more SPAA 2005»

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

13 years 10 months ago

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

Download cone.informatik.uni-freiburg.de

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

Real-time Traffic

Distributed And Parallel Computing | Graph Transformation Algorithm | Operation Preserves Regularity | Regular Undirected Graphs | SPAA 2005 |

claim paper

Related Content

» Strong Formulations for 2NodeConnected Steiner Network Problems

» PINCoC A Coclustering Based Approach to Analyze ProteinProtein Interaction Networks

» Characterization of proteininteraction networks in tumors

» Emergence of global network property based on multiagent voting model

» Analyzing Kleinbergs and other smallworld Models

» Multicast capacity for hybrid wireless networks

» OpenCV Open Source Computer Vision Reference Manual

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	SPAA
Authors	Peter Mahlmann, Christian Schindelhauer

Comments (0)