Separate, Measure and Conquer

DOI10.1145/3111499zbMath1436.68394arXiv1404.0753OpenAlexW2774159520MaRDI QIDQ4554934

Gregory B. Sorkin, Serge Gaspers

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

measure and conquergraph separatorsMax 2-CSPcounting dominating sets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational aspects of satisfiability (68R07)

Related Items (1)

Faster graph coloring in polynomial space

This page was built for publication: Separate, Measure and Conquer