Sparsification upper and lower bounds for graph problems and not-all-equal SAT

DOI10.1007/s00453-016-0189-9zbMath1372.68129MaRDI QIDQ2408194

Bart M. P. Jansen, Astrid Pieterse

Publication date: 10 October 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0189-9

zbMATH Keywords

graph coloring; Hamiltonian cycle; satisfiability; sparsification

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)