A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326)

From MaRDI portal
Revision as of 14:13, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
scientific article

    Statements

    A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (English)
    0 references
    0 references
    1987
    0 references
    planar graph
    0 references
    triangulated graphs
    0 references
    components
    0 references
    rectangular dual
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers