Efficient Pattern Matching on Graph Patterns of Bounded Treewidth

DOI10.1016/J.ENDM.2011.05.021zbMath1268.05217OpenAlexW2091386242MaRDI QIDQ2840694

Takashi Yamada, Takayoshi Shoudai

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.021

zbMATH Keywords

treewidthpartial \(k\)-treepattern matching problemgraph pattern

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Learning block-preserving graph patterns and its application to data mining
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Complexity of Finding Embeddings in a k-Tree

This page was built for publication: Efficient Pattern Matching on Graph Patterns of Bounded Treewidth