1594 search results - page 52 / 319 » An Algorithm to Compute Collusion Paths |
165
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
102
click to vote
DAC
2010
ACM
15 years 3 months ago
2010
ACM
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
101
click to vote
IPL
2010
14 years 10 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
BIRTHDAY
2010
Springer
15 years 27 days ago
2010
Springer
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...