Algebras for Tree Decomposable Graphs

DOI10.1007/978-3-030-51372-6_12zbMath1502.68213OpenAlexW3037402335MaRDI QIDQ5100734

Roberto Bruni, Matteo Sammartino, Ugo Montanari

Publication date: 1 September 2022

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51372-6_12

zbMATH Keywords

tree decompositiongraph algebrasbigraphs

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monadic second-order evaluations on tree-decomposable graphs
• Graph minors. III. Planar tree-width
• About permutation algebras, (pre)sheaves and named sets
• Treewidth. Computations and approximations
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Decomposition structures for soft constraint evaluation problems: an algebraic approach
• On non-serial dynamic programming
• Flowgraphs and Flow Algebras
• Computing the Minimum Fill-In is NP-Complete
• Handbook of Graph Grammars and Computing by Graph Transformation
• Some Applications of the Theory of Dynamic Programming—A Review

This page was built for publication: Algebras for Tree Decomposable Graphs