A Note on Algebraic Structure of Tree Decomposition of Graphs
No abstract available.
Related papers
- Quantifier Elimination Meets Treewidth TACAS 2026
- Reachability Analysis Using Message Passing over Tree Decompositions CAV 2020
- Structural recursion for querying ordered graphs ICFP 2013
- Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses APLAS 2002
- Fully Automated Shape Analysis Based on Forest Automata CAV 2013
- Functional Programming with Graphs ICFP 1997
- System f-omega with equirecursive types for datatype-generic programming POPL 2016
- A Note on Median Split Trees TOPLAS 1980