Graph similarity scoring and matching (Q2472827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance metric combining maximum common subgraph and minimum common supergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authoritative sources in a hyperlinked environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An eigendecomposition approach to weighted graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caps and Robbers: What Can You Expect? / rank
 
Normal rank

Latest revision as of 16:48, 27 June 2024

scientific article
Language Label Description Also known as
English
Graph similarity scoring and matching
scientific article

    Statements

    Graph similarity scoring and matching (English)
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    graphs and networks
    0 references
    graph algorithms
    0 references
    similarity measures
    0 references
    graph matching
    0 references
    graph alignment
    0 references
    0 references
    0 references
    0 references

    Identifiers