Fast exact algorithms for some connectivity problems parameterized by clique-width - Archive ouverte HAL
Article Dans Une Revue Theor. Comput. Sci. Année : 2019

Fast exact algorithms for some connectivity problems parameterized by clique-width

Dates et versions

hal-04492606 , version 1 (06-03-2024)

Identifiants

Citer

Benjamin Bergougnoux, Mamadou Moustapha Kanté. Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci., 2019, 782, pp.30--53. ⟨10.1016/J.TCS.2019.02.030⟩. ⟨hal-04492606⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

More