A linear algorithm to find a rectangular dual of a planar triangulated graph (Q1097704)

From MaRDI portal
Revision as of 19:56, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56059583, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
A linear algorithm to find a rectangular dual of a planar triangulated graph
scientific article

    Statements

    title
    A linear algorithm to find a rectangular dual of a planar triangulated graph (English)
    0 references
    author
    Jayaram Bhasker
    0 references
    Sartaj K. Sahni
    0 references
    published in
    Algorithmica
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    linear algorithm
    0 references
    rectangular dual
    0 references
    planar triangulated graph
    0 references

    Identifiers

    DOI
    10.1007/BF01762117
    0 references
    zbMATH DE Number
    4035175
    0 references
    Wikidata QID
    Q56059583
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1097704&oldid=15041587"
    Powered by MediaWiki