Pages that link to "Item:Q1338451"
From MaRDI portal
The following pages link to Treewidth. Computations and approximations (Q1338451):
Displaying 50 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs (Q400521) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs (Q412366) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Edge monitoring problem on interval graphs (Q510622) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Matching interdiction (Q602686) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Computing bond orders in molecule graphs (Q631782) (← links)
- Minesweeper on graphs (Q632908) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Complexity of secure sets (Q722534) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Dense trees: a new look at degenerate graphs (Q849635) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Refining the complexity of the sports elimination problem (Q896666) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
