Pages that link to "Item:Q3751595"
From MaRDI portal
The following pages link to Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595):
Displaying 50 items.
- Directed NLC-width (Q906393) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Understanding the scalability of Bayesian network inference using clique tree growth curves (Q991030) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Tree clustering for constraint networks (Q1116363) (← 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)
- 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)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- A comparison of graphical techniques for decision analysis (Q1341983) (← links)
- Probability propagation (Q1356197) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On the extension of a partial metric to a tree metric (Q1422428) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
