Nearly exact mining of frequent trees in large networks (Q2435702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10618-013-0321-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: All normalized anti-monotonic overlap graph measures are bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3586724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3510469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient frequent connected subgraph mining in graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming Graph Data for Statistical Relational Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10618-013-0321-2 / rank
 
Normal rank

Latest revision as of 15:09, 18 December 2024

scientific article
Language Label Description Also known as
English
Nearly exact mining of frequent trees in large networks
scientific article

    Statements

    Nearly exact mining of frequent trees in large networks (English)
    0 references
    0 references
    0 references
    19 February 2014
    0 references
    graph mining
    0 references
    pattern mining
    0 references
    pattern matching
    0 references
    isomorphism
    0 references
    subgraph isomorphism
    0 references
    homomorphism
    0 references
    0 references
    0 references
    0 references

    Identifiers