2079 search results - page 273 / 416 » Universality of random graphs |
156
Voted
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
157
click to vote
PKDD
2007
Springer
15 years 10 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
147
click to vote
VALUETOOLS
2006
ACM
15 years 10 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
128
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
149
click to vote
ISCAS
2003
IEEE
15 years 10 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...