23 citations · 149 across the 34 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Ranked Enumeration of Minimal Triangulations
Noam Ravid, Dori Medini, Benny Kimelfeld
A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of pro…
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…