Sciweavers

Share
204 search results - page 1 / 41
» Packing vertices and edges in random regular graphs
Sort
View
RSA
2008
47views more  RSA 2008»
12 years 1 months ago
Packing vertices and edges in random regular graphs
Mihalis Beis, William Duckworth, Michele Zito
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
12 years 1 months ago
Neighbour-Distinguishing Edge Colourings of Random Regular Graphs
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
Catherine S. Greenhill, Andrzej Rucinski
SPAA
2005
ACM
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 defin...
Peter Mahlmann, Christian Schindelhauer
RSA
2006
66views more  RSA 2006»
12 years 1 months ago
Regular graphs whose subgraphs tend to be acyclic
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
Noga Alon, Eitan Bachmat
MFCS
2007
Springer
12 years 8 months ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
William Duckworth, Michele Zito
books