Embedding rectilinear graphs in linear time (Q1111399)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4076654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding rectilinear graphs in linear time |
scientific article; zbMATH DE number 4076654 |
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
0.8470003008842468
0 references
0.8272192478179932
0 references
0.824537992477417
0 references
0.8245336413383484
0 references
0.8171077370643616
0 references
