Pages that link to "Item:Q1271620"
From MaRDI portal
The following pages link to All structured programs have small tree width and good register allocation (Q1271620):
Displayed 31 items.
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Register loading via linear programming (Q494793) (← links)
- Complexity of secure sets (Q722534) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Tight bounds for reachability problems on one-counter and pushdown systems (Q2032173) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- The tree-width of C (Q2174562) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Synthesizing structured reactive programs via deterministic tree automata (Q2346409) (← links)
- The complexity of register allocation (Q2442207) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5111890) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- Tree-decompositions of small pathwidth (Q5899355) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Efficient interprocedural data-flow analysis using treedepth and treewidth (Q6174398) (← links)