17 citations · 42 across the 15 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017★ 2 cited
Fast exact algorithms for some connectivity problems parametrized by clique-width
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Given a clique-width -expression of a graph , we provide time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted…
cs.DS2017
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
In this paper, we prove that, given a clique-width -expression of an -vertex graph, \textsc{Hamiltonian Cycle} can be solved in time . This improves the n…