25 citations · 109 across the 80 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 5 cited
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
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…
cs.DS2012
Obtaining Planarity by Contracting Few Edges
Petr A. Golovach, Pim van 't Hof, Daniel Paulusma
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is…