13 citations · 77 across the 56 of their papers we have counts for
1 paper · 2 filters
Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná +2
Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph…