On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs

Type de document :
Communication dans un congrès
COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. 10th International Conference on Combinatorial Optimization and Applications, LNCS (10043), pp.423-437, 2016, Combinatorial Optimization and Applications. 〈10.1007/978-3-319-48749-6_31〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481787
Contributeur : Ignasi Sau <>
Soumis le : jeudi 2 mars 2017 - 22:01:20
Dernière modification le : mercredi 19 septembre 2018 - 20:46:02

Lien texte intégral

Identifiants

Collections

Citation

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, et al.. On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. 10th International Conference on Combinatorial Optimization and Applications, LNCS (10043), pp.423-437, 2016, Combinatorial Optimization and Applications. 〈10.1007/978-3-319-48749-6_31〉. 〈lirmm-01481787〉

Partager

Métriques

Consultations de la notice

88