activity
20112018
most citedGenerating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay

5 citations · 12 across the 6 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.DS2015★ 2 cited

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté +3

The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this pape…