Embedding rectilinear graphs in linear time (Q1111399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90032-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2166449951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and Labyrinths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The embeddings of a graph—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear Graphs and Their Embeddings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:58, 19 June 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
    0 references
    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
    0 references
    graph embedding
    0 references
    linear-time algorithm
    0 references
    rectilinear graphs
    0 references
    0 references