Algebras for tree decomposable graphs
DOI10.1007/978-3-030-51372-6_12zbMATH Open1502.68213OpenAlexW3037402335MaRDI QIDQ5100734FDOQ5100734
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
Recommendations
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
- Handbook of constraint programming.
- Title not available (Why is that?)
- Treewidth. Computations and approximations
- Handbook of Graph Grammars and Computing by Graph Transformation
- Computing the Minimum Fill-In is NP-Complete
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- On non-serial dynamic programming
- Graph minors. III. Planar tree-width
- Monadic second-order evaluations on tree-decomposable graphs
- About permutation algebras, (pre)sheaves and named sets
- Flowgraphs and Flow Algebras
- Title not available (Why is that?)
- Some Applications of the Theory of Dynamic Programming—A Review
- Decomposition structures for soft constraint evaluation problems: an algebraic approach
- Axiomatizing binding bigraphs
Cited In (3)
This page was built for publication: Algebras for tree decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100734)
