Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliques - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliques

Fichier non déposé

Dates et versions

hal-01216955 , version 1 (18-10-2015)

Identifiants

Citer

Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliques. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. pp.499-512, ⟨10.1007/978-3-662-53174-7_35⟩. ⟨hal-01216955⟩
34 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More