Maximizing Happiness in Graphs of Bounded Clique-Width

10 Mar 2020 Bliznets Ivan Sagunov Danil

Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS