Efficient Pattern Matching on Graph Patterns of Bounded Treewidth (Q2840694): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2011.05.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2091386242
@@ Property / OpenAlex ID: W2091386242 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Efficient frequent connected subgraph mining in graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+Learning block-preserving graph patterns and its application to data mining
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2840694