Pages that link to "Item:Q685464"
From MaRDI portal
The following pages link to Monadic second-order evaluations on tree-decomposable graphs (Q685464):
Displaying 39 items.
- A general framework for path convexities (Q2156285) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- On the tree-width of planar graphs (Q2851524) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- (Q3386630) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
- Least solutions of equations over N (Q4632443) (← links)
- (Q4852905) (← links)
- (Q5091010) (← links)
- (Q5092394) (← links)
- Algebras for Tree Decomposable Graphs (Q5100734) (← links)
- (Q5111875) (← links)
- (Q5111885) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)
