Sciweavers

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

94

Voted

RSA
2008

47views more RSA 2008»

Packing vertices and edges in random regular graphs

15 years 2 months ago

Packing vertices and edges in random regular graphs

Download www.csc.liv.ac.uk

Mihalis Beis, William Duckworth, Michele Zito

Real-time Traffic

RSA 2008 |

claim paper

Related Content

» NeighbourDistinguishing Edge Colourings of Random Regular Graphs

» Peertopeer networks based on random transformations of connected regular undirected graphs

» Regular graphs whose subgraphs tend to be acyclic

» Uncover Low Degree Vertices and Minimise the Mess Independent Sets in Random Regular Graph...

» Almost universal graphs

» Rumor Spreading on Random Regular Graphs and Expanders

» Local resilience of almost spanning trees in random graphs

» Perfect packings with complete graphs minus an edge

» Regular induced subgraphs of a random Graph

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	RSA
Authors	Mihalis Beis, William Duckworth, Michele Zito

Comments (0)