Pages that link to "Item:Q5691297"
From MaRDI portal
The following pages link to A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth (Q5691297):
Displaying 50 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Improving robustness of next-hop routing (Q266050) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Coloring immersion-free graphs (Q326817) (← 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)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
