Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (Q2840694): 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: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / 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: Learning block-preserving graph patterns and its application to data mining / rank | |||
Normal rank | |||
Latest revision as of 16:27, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Pattern Matching on Graph Patterns of Bounded Treewidth |
scientific article |
Statements
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (English)
0 references
23 July 2013
0 references
graph pattern
0 references
pattern matching problem
0 references
treewidth
0 references
partial \(k\)-tree
0 references
