35 citations · 53 across the 6 of their papers we have counts for
1 paper · 1 filter
James Abello, Pavel Klavík, Jan Kratochvíl +1
We study the computational complexity of graph planarization via edge contraction. The problem CONTRACT asks whether there exists a set S of at most k edges that when contracte…