Computing cartograms with optimal complexity (Q5891266)

From MaRDI portal
Revision as of 01:06, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6223065
Language Label Description Also known as
English
Computing cartograms with optimal complexity
scientific article; zbMATH DE number 6223065

    Statements

    title
    Computing cartograms with optimal complexity (English)
    0 references
    author
    Md. Jawaherul Alam
    0 references
    Stefan Felsner
    0 references
    Michael Kaufmann
    0 references
    Stephen G. Kobourov
    0 references
    Torsten Ueckerdt
    0 references
    Therese C. Biedl
    0 references
    publication date
    6 November 2013
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C10
    0 references
    05C35
    0 references
    05C45
    0 references
    05C62
    0 references
    zbMATH DE Number
    6223065
    0 references
    zbMATH Keywords
    planar graphs
    0 references
    geometric representations
    0 references
    contact graphs
    0 references
    cartograms
    0 references
    Wikidata QID
    Q56689777
    0 references
    OpenAlex ID
    W2051728965
    0 references
    cites work
    Q3138887
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5891266&oldid=35358843"
    Powered by MediaWiki