Showing 2016Show all
2 papers · 1 filter
cs.CC2016
A Complexity Theory for Hard Enumeration Problems
Nadia Creignou, Markus Kröll, Reinhard Pichler +2
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, t…
cs.DS2016
Efficiently Enumerating Minimal Triangulations
Nofar Carmeli, Batya Kenig, Benny Kimelfeld +1
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper t…