3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 1 cited
A New Approach to Efficient Enumeration by Push-out Amortization
Takeaki Uno
Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the comp…
cs.DS2014★ 3 cited
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +2
An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal proble…
cs.DM2012
On Complexity of Flooding Games on Graphs with Interval Representations
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara +2
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors o…