48 search results - page 6 / 10 » Distribution of Vertex Degree in Web-Graphs |
107
click to vote
DM
2010
14 years 11 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
115
click to vote
MICS
2010
14 years 10 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
101
Voted
JCT
2007
14 years 11 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
94
Voted
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...