Algorithms for graphs embeddable with few crossings per edge (Q2461632)

From MaRDI portal
Revision as of 19:08, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for graphs embeddable with few crossings per edge
scientific article

    Statements

    title
    Algorithms for graphs embeddable with few crossings per edge (English)
    0 references
    author
    Alexander Grigoriev
    0 references
    Hans L. Bodlaender
    0 references
    published in
    Algorithmica
    0 references
    publication date
    28 November 2007
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05C85
    0 references
    90C35
    0 references
    zbMATH DE Number
    5215531
    0 references
    OpenAlex ID
    W2899777575
    0 references
    Wikidata QID
    Q30053231
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2461632&oldid=39099087"
    Powered by MediaWiki