1447 search results - page 76 / 290 » Graphs and Path Equilibria |
170
click to vote
SIROCCO
2004
15 years 8 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...
197
click to vote
ESA
1998
Springer
15 years 11 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...
171
click to vote
CIKM
2009
Springer
16 years 1 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...
153
click to vote
IPL
2007
15 years 6 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...
183
click to vote
ALT
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts