Abstract
The embedding problem for a class of graphs called rectilinear graphs is discussed. These graphs have applications in many VLSI layout problems. An interesting topological characterization of these graphs leads to efficient algorithms for recognizing and embedding rectilinear graphs which are embeddable on the plane.
Original language | English |
---|---|
Pages (from-to) | 355-372 |
Number of pages | 18 |
Journal | SIAM Journal on Computing |
Volume | 14 |
Issue number | 2 |
DOIs | |
State | Published - 1985 |
Externally published | Yes |