Algorithmic Aspects of the Maximum Colorful Arborescence Problem

Type de document :
Communication dans un congrès
Theory and Applications of Models of Computation - 14th Annual Conference, Apr 2017, Berne, Switzerland. Springer, Proceedings of TAMC 2017 (Theory and Applications of Models of Computation - 14th Annual Conference), Lecture Notes in Computer Science (10185), pp.216-230, 〈10.1007/978-3-319-55911-7_16〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01524069
Contributeur : Guillaume Fertin <>
Soumis le : mercredi 17 mai 2017 - 14:17:27
Dernière modification le : jeudi 19 avril 2018 - 11:46:05

Identifiants

Collections

Citation

Guillaume Fertin, Julien Fradin, Géraldine Jean. Algorithmic Aspects of the Maximum Colorful Arborescence Problem. Theory and Applications of Models of Computation - 14th Annual Conference, Apr 2017, Berne, Switzerland. Springer, Proceedings of TAMC 2017 (Theory and Applications of Models of Computation - 14th Annual Conference), Lecture Notes in Computer Science (10185), pp.216-230, 〈10.1007/978-3-319-55911-7_16〉. 〈hal-01524069〉

Partager

Métriques

Consultations de la notice

146