2079 search results - page 274 / 416 » Universality of random graphs |
140
click to vote
ISAAC
2000
Springer
15 years 8 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
130
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
124
Voted
ICCSA
2010
Springer
15 years 6 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
128
Voted
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
139
click to vote
MASCOTS
2003
15 years 6 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...