2270 search results - page 49 / 454 » On the distribution of eigenvalues of graphs |
119
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
JCT
2008
15 years 1 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
132
click to vote
MODELS
2009
Springer
15 years 8 months ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
126
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
160
click to vote
ICDCS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...