1952 search results - page 284 / 391 » Complete partitions of graphs |
170
click to vote
AAAI
1996
15 years 7 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
249
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
175
click to vote
AH
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
176
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
163
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...