Patterns with Bounded Treewidth

DOI10.1007/978-3-642-28332-1_40MaRDI QIDQ2890220zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach, Markus L. Schmid

Publication date 8 June 2012

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://dspace.lboro.ac.uk/2134/9556

zbMATH Keywords

treewidthpattern languagesextended regular expressionsmembership problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Patterns with bounded treewidth
• Efficient pattern matching on graph patterns of bounded treewidth
• Patterns and pattern-matching in trees: An analysis
• Graph contraction pattern matching for graphs of bounded treewidth
• On the complexity of enumerating the answers to well-designed pattern trees
• Noncontiguous pattern containment in binary trees
• scientific article; zbMATH DE number 4053042
• On the complexity of tree pattern containment with arithmetic comparisons
• Pattern avoidance in binary trees
• Characterizing tractability of simple well-designed pattern trees with projection

Cited in

(7)

• scientific article; zbMATH DE number 7561480 (Why is no real title available?)
• Patterns with bounded treewidth
• On the parameterised complexity of string morphism problems
• Efficient pattern matching on graph patterns of bounded treewidth
• Pattern avoidance in binary trees
• A note on the complexity of matching patterns with variables
• Noncontiguous pattern containment in binary trees

This page was built for publication: Patterns with Bounded Treewidth

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