1594 search results - page 48 / 319 » An Algorithm to Compute Collusion Paths |
110
click to vote
DAM
2011
14 years 6 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
VLSID
2005
IEEE
16 years 5 days ago
2005
IEEE
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...