9532 search results - page 413 / 1907 » Logic, Graphs, and Algorithms |
217
click to vote
SODA
2007
ACM
15 years 9 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
193
click to vote
SODA
2003
ACM
15 years 9 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
250
click to vote
IWPEC
2010
Springer
15 years 5 months ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
231
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
232
click to vote
FCT
2003
Springer
16 years 27 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...