Efficient pattern matching on graph patterns of bounded treewidth

DOI10.1016/J.ENDM.2011.05.021MaRDI QIDQ2840694zbMATH OpenOpenAlexFDO

Authors 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

graph patternpartial \(k\)-treepattern matching problemtreewidth

Mathematics Subject Classification ID

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

Recommendations

• Graph contraction pattern matching for graphs of bounded treewidth
• Patterns with bounded treewidth
• Patterns with Bounded Treewidth
• Polynomial time pattern matching algorithm for ordered graph patterns
• Polynomial time algorithms for variants of graph matching on partial k-trees

Cites work

• Complexity of Finding Embeddings in a k-Tree
• 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

Cited in

(8)

• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• scientific article; zbMATH DE number 1629832 (Why is no real title available?)
• Patterns with Bounded Treewidth
• Graph contraction pattern matching for graphs of bounded treewidth
• scientific article; zbMATH DE number 4053042 (Why is no real title available?)
• Patterns with bounded treewidth
• Polynomial time pattern matching algorithm for ordered graph patterns
• More efficient bottom-up multi-pattern matching in trees

This page was built for publication: Efficient pattern matching on graph patterns of bounded treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840694)