Polynomial time pattern matching algorithm for ordered graph patterns

DOI10.1007/978-3-642-38812-5_7MaRDI QIDQ4928410zbMATH OpenOpenAlexFDO

Authors Takahiro Hino, Yusuke Suzuki, Tomoyuki Uchida, Yuko Itokawa

Publication date 14 June 2013

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38812-5_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1950784
• Learning Unordered Tree Contraction Patterns in Polynomial Time
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 2089361
• Efficient pattern matching on graph patterns of bounded treewidth

Cited in

(2)

• Efficient pattern matching on graph patterns of bounded treewidth
• A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns

This page was built for publication: Polynomial time pattern matching algorithm for ordered graph patterns

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