Work

Shortest Path Computations in S-Graphs

Year: 1991
Type: article
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W1493370921
FWCI: 0.466
Cites: 4
Cited by: 2
Related to: 10