5 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch +1
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bip…