1172 search results - page 96 / 235 » Path Algorithms on Regular Graphs |
128
Voted
DAM
1999
15 years 5 days ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
126
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
130
Voted
CORR
2008
Springer
15 years 2 days ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
92
Voted
IJCV
2002
15 years 8 days ago
2002
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...