Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869)

From MaRDI portal
Revision as of 11:05, 28 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
scientific article

    Statements

    title
    Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (English)
    0 references
    author
    Feodor F. Dragan
    0 references
    Guillaume Ducoffe
    0 references
    Heather M. Guarnera
    0 references
    publication date
    25 March 2022
    0 references
    cites work
    Q3514516
    0 references
    Dually Chordal Graphs
    0 references
    Q5009466
    0 references
    Q4034774
    0 references
    Slimness of graphs
    0 references
    Q4272121
    0 references
    Q4607914
    0 references
    Q3772406
    0 references
    Network Analysis
    0 references

    Identifiers

    zbMATH DE Number
    7498685
    0 references
    OpenAlex ID
    W3198400301
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q832869&oldid=36783509"
    Powered by MediaWiki