An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

Abstract : In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cycle can be solved in time n O(k). This improves the naive algorithm that runs in time n O(k 2) by Espelage et al. (WG 2001), and it also matches with the lower bound result by Fomin et al. that, unless the Exponential Time Hypothesis fails, there is no algorithm running in time n o(k) (SIAM. J. Computing 2014). We present a technique of representative sets using two-edge colored multigraphs on k vertices. The essential idea is that, for a two-edge colored multigraph, the existence of an Eulerian trail that uses edges with different colors alternately can be determined by two information: the number of colored edges incident with each vertex, and the connectedness of the multigraph. With this idea, we avoid the bottleneck of the naive algorithm, which stores all the possible multigraphs on k vertices with at most n edges.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01858180
Contributor : Benjamin Bergougnoux <>
Submitted on : Monday, August 20, 2018 - 10:38:16 AM
Last modification on : Monday, January 20, 2020 - 12:14:06 PM
Long-term archiving on: Wednesday, November 21, 2018 - 12:56:51 PM

File

hamiltonian.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01858180, version 1

Collections

Citation

Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.. 2018. ⟨hal-01858180⟩

Share

Metrics

Record views

97

Files downloads

140