204 search results - page 33 / 41 » Packing vertices and edges in random regular graphs |
JCO
2010
13 years 6 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
CN
2008
13 years 7 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
GD
2003
Springer
14 years 25 days ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
CDC
2009
IEEE
14 years 10 days ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...