Succinct permutation graphs (Q2684486)

From MaRDI portal
Revision as of 18:03, 19 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
Succinct permutation graphs
scientific article

    Statements

    title
    Succinct permutation graphs (English)
    0 references
    author
    Sebastian Wild
    0 references
    Victor Zamaraev
    0 references
    published in
    Algorithmica
    0 references
    publication date
    16 February 2023
    0 references
    zbMATH Keywords
    succinct data structures
    0 references
    distance oracles
    0 references
    permutation graphs
    0 references
    bipartite permutations graphs
    0 references
    circular permutation graphs
    0 references
    graph compression
    0 references
    graph encoding
    0 references
    cites work
    Partially Ordered Sets
    0 references
    Q4349924
    0 references
    Q3686754
    0 references
    Q5091062
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P05
    0 references
    05C85
    0 references
    68R10
    0 references
    68W05
    0 references
    zbMATH DE Number
    7654494
    0 references
    OpenAlex ID
    W3092624644
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2684486&oldid=39195420"
    Powered by MediaWiki