763 search results - page 118 / 153 » Engineering Shortest Path Algorithms |
130
click to vote
SIGCOMM
1999
ACM
15 years 8 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
156
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
116
click to vote
AVI
2004
15 years 5 months ago
2004
This paper describes two visualisation algorithms that give an impression of current activity on a web site. Both focus on giving a sense of the trail of individual visitors withi...
162
click to vote
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
177
click to vote
TVCG
2011
14 years 11 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...