An algorithm using length-r paths to approximate subgraph isomorphism (Q4421027)

From MaRDI portal
Revision as of 11:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1967167
Language Label Description Also known as
English
An algorithm using length-r paths to approximate subgraph isomorphism
scientific article; zbMATH DE number 1967167

    Statements

    An algorithm using length-r paths to approximate subgraph isomorphism (English)
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    Approximate graph matching
    0 references
    Subgraph isomorphism
    0 references
    Attributed relational graphs
    0 references

    Identifiers