scientific article

zbMath1231.05252arXiv1107.1177MaRDI QIDQ3012402

Stefan Szeider

Publication date: 6 July 2011

Full work available at URL: https://arxiv.org/abs/1107.1177

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringtreewidth\(W[1\)-hardness]general factorsgeneralized satisfiabilityminimum maximum outdegree orientations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

On parameterized complexity of liquid democracy ⋮ The balanced satisfactory partition problem ⋮ Defensive alliances in graphs of bounded treewidth ⋮ On the harmless set problem parameterized by treewidth ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Parameterized orientable deletion ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Problems hard for treewidth but easy for stable gonality ⋮ Unnamed Item ⋮ Extended MSO model checking via small vertex integrity ⋮ Matchings with lower quotas: algorithms and complexity ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Complexity of secure sets ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity

This page was built for publication: