706 search results - page 6 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
IJCGA
2008
13 years 7 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
JAL
2007
13 years 7 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
DAC
1999
ACM
13 years 12 months ago
1999
ACM