Pages that link to "Item:Q2392037"
From MaRDI portal
The following pages link to Treewidth computation and extremal combinatorics (Q2392037):
Displaying 21 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Computing tree-depth faster than \(2^n\) (Q493242) (← links)
- Tractability of most probable explanations in multidimensional Bayesian network classifiers (Q1726375) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Experimental Analysis of Treewidth (Q5042459) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
