1172 search results - page 58 / 235 » Path Algorithms on Regular Graphs |
118
click to vote
ESA
1998
Springer
15 years 4 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...
108
click to vote
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
104
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
WG
2001
Springer
15 years 4 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
108
click to vote
IEEECIT
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...