Reconstructing Cactus Graphs from Shortest Path Information (Q2830066)

From MaRDI portal
Revision as of 22:25, 12 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
Reconstructing Cactus Graphs from Shortest Path Information
scientific article

    Statements

    title
    Reconstructing Cactus Graphs from Shortest Path Information (English)
    0 references
    author
    Yun Lu
    0 references
    Evangelos Kranakis
    0 references
    Danny Krizanc
    0 references
    publication date
    9 November 2016
    0 references
    zbMATH Keywords
    graph reconstruction
    0 references
    shortest path information
    0 references
    cactus graph
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    90B10
    0 references
    zbMATH DE Number
    6649754
    0 references
    OpenAlex ID
    W2491586093
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2830066&oldid=36286446"
    Powered by MediaWiki