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.
- Improving robustness of next-hop routing (Q266050) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Decomposition width of matroids (Q415290) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- PRM inference using Jaffray \& Faÿ's local conditioning (Q649983) (← links)
- The three-in-a-tree problem (Q653792) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Complexity of secure sets (Q722534) (← links)
- Perspectives on the theory and practice of belief functions (Q751097) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Achievable sets, brambles, and sparse treewidth obstructions (Q881587) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
