论文信息 - Shortest Path Computations in S-Graphs

Shortest Path Computations in S-Graphs

We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a number of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.

Susanne E. Hambrusch | Greg N. Frederickson | Hung-Yi Tu

[1] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[2] Charles E. Leiserson,et al. A Mixed-Integer Linear Programming Problem which is Efficiently Solvable , 1988, J. Algorithms.

[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[4] Susanne E. Hambrusch,et al. A Framework for 1-D Compaction with Forbidden Region Avoidance , 1991, Comput. Geom..

[5] Michael Segal,et al. A framework for 1-D compaction with forbidden region avoidance , 1992 .