Minimal connected enclosures on an embedded planar graph (Q1283782)

From MaRDI portal
Revision as of 10:44, 25 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126562854, #quickstatements; #temporary_batch_1719308576476)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimal connected enclosures on an embedded planar graph
scientific article

    Statements

    title
    Minimal connected enclosures on an embedded planar graph (English)
    0 references
    author
    Christos Alexopoulos
    0 references
    J. Scott Provan
    0 references
    H. Donald Ratliff
    0 references
    Bryan R. Stutzman
    0 references
    publication date
    30 March 1999
    0 references
    zbMATH Keywords
    polynomial algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C05
    0 references
    05C10
    0 references
    05C38
    0 references
    zbMATH DE Number
    1271062
    0 references
    Wikidata QID
    Q126562854
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1283782&oldid=34908534"
    Powered by MediaWiki