Graph simplification and matching using commute times (Q2373488)

From MaRDI portal
Revision as of 16:09, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/pr/QiuH07, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph simplification and matching using commute times
scientific article

    Statements

    title
    Graph simplification and matching using commute times (English)
    0 references
    author
    Huaijun Qiu
    0 references
    Edwin R. Hancock
    0 references
    publication date
    11 July 2007
    0 references
    zbMATH Keywords
    graph-matching
    0 references
    graph simplification
    0 references
    commute time
    0 references
    graph spectrum
    0 references

    Identifiers

    zbMATH DE Number
    5170534
    0 references
    Wikidata QID
    Q60431201
    0 references
    OpenAlex ID
    W2150217673
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2373488&oldid=37908440"
    Powered by MediaWiki