Pages that link to "Item:Q1186787"
From MaRDI portal
The following pages link to Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787):
Displayed 31 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Safe separators for treewidth (Q819825) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- A note on trees, tables, and algorithms (Q5191139) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)