829 search results - page 19 / 166 » Distance domination-critical graphs |
SIAMCOMP
2002
14 years 9 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
COMBINATORICS
2007
14 years 9 months ago
2007
PVLDB
2010
14 years 7 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
159
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
— The IDMaps project aims to provide a distance map of the Internet from which relative distances between hosts on the Internet can be gauged [1]. Many distributed systems and ap...