1986 search results - page 83 / 398 » Path Separability of Graphs |
128
Voted
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
126
click to vote
SIROCCO
2004
15 years 4 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
142
Voted
ESA
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
120
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
106
click to vote
IPL
2007
15 years 3 months ago
2007
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...