A new dissimilarity measure for comparing labeled graphs (Q1938689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2012.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008106405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance metric based on the maximal common subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance measure for image analysis / 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: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral embedding of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance measure between attributed relational graphs for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896075 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:53, 6 July 2024

scientific article
Language Label Description Also known as
English
A new dissimilarity measure for comparing labeled graphs
scientific article

    Statements

    A new dissimilarity measure for comparing labeled graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    labeled graph dissimilarity
    0 references
    spectral graph comparison
    0 references
    graph Laplacian
    0 references
    0 references