Comparing large graphs efficiently by margins of feature vectors (Q2372051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inexact graph matching for structural pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3047588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3896506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance between unordered labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a certain distance between isomorphism classes of graphs / rank
 
Normal rank

Latest revision as of 11:01, 26 June 2024

scientific article
Language Label Description Also known as
English
Comparing large graphs efficiently by margins of feature vectors
scientific article

    Statements

    Comparing large graphs efficiently by margins of feature vectors (English)
    0 references
    0 references
    0 references
    10 July 2007
    0 references
    graph similarity
    0 references
    directed and undirected graphs
    0 references
    degree vectors
    0 references
    similarity measures
    0 references

    Identifiers