scientific article
zbMATH Open1231.05252arXiv1107.1177MaRDI QIDQ3012402FDOQ3012402
Authors: Stefan Szeider 
Publication date: 6 July 2011
Full work available at URL: https://arxiv.org/abs/1107.1177
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 4081531
- Easy problems for tree-decomposable graphs
- Some results on tree decomposition of graphs
- A note on the tree decompositions of graphs
- scientific article; zbMATH DE number 866654
- Tree decompositions for a class of graphs
- Decompositions of graphs into trees
- Decomposition of complete graphs into arbitrary trees
- Tree decompositions of multigraphs
- Tree decompositions of graphs without large bipartite holes
treewidthgraph coloring\(W[1\)-hardness]general factorsgeneralized satisfiabilityminimum maximum outdegree orientations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (14)
- Grundy Distinguishes Treewidth from Pathwidth
- On parameterized complexity of liquid democracy
- The balanced satisfactory partition problem
- Complexity and approximability of parameterized MAX-CSPs
- Defensive alliances in graphs of bounded treewidth
- Parameterized orientable deletion
- Complexity of secure sets
- Extended MSO model checking via small vertex integrity
- On the harmless set problem parameterized by treewidth
- Problems hard for treewidth but easy for stable gonality
- Grundy distinguishes treewidth from pathwidth
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Matchings with lower quotas: algorithms and complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012402)
