Embedding rectilinear graphs in linear time (Q1111399): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding rectilinear graphs in linear time |
scientific article |
Statements
Embedding rectilinear graphs in linear time (English)
0 references
1988
0 references
A linear-time algorithm is presented to recognize and embed rectilinear graphs which are embeddable on the plane. Previously, only the \(O(n^ 2)\) time algorithm of \textit{G. Vijayan} and \textit{A. Wigderson} [SIAM J. Comput. 14, 355-372 (1985; Zbl 0568.05024)] was known. The algorithm described here uses a different and surprisingly simple strategy.
0 references
graph embedding
0 references
linear-time algorithm
0 references
rectilinear graphs
0 references
