Probabilistic and exact frequent subtree mining in graphs beyond forests (Q2425250): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(n2.5) time algorithms for the subgraph homeomorphism problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequent Hypergraph Mining / 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: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subtree Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3300156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic frequent subtrees for efficient graph classification and retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228482 / rank
 
Normal rank

Latest revision as of 17:34, 19 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic and exact frequent subtree mining in graphs beyond forests
scientific article

    Statements

    Probabilistic and exact frequent subtree mining in graphs beyond forests (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2019
    0 references
    pattern mining
    0 references
    frequent subgraph mining
    0 references
    frequent subtree mining
    0 references
    probabilistic patterns
    0 references

    Identifiers