Pages that link to "Item:Q1062758"
From MaRDI portal
The following pages link to Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- DAG-based attack and defense modeling: don't miss the forest for the attack trees (Q473215) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Girth and treewidth (Q707020) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Temporal constraint networks (Q1182161) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Structure identification in relational data (Q1204870) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Efficient enumeration of all minimal separators in a graph (Q1390866) (← links)
- Local and global relational consistency (Q1391940) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- An algorithm for the Tutte polynomials of graphs of bounded treewidth (Q1584397) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
