On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02081156
Contributor : Guillaume Fertin <>
Submitted on : Wednesday, March 27, 2019 - 12:43:47 PM
Last modification on : Monday, May 6, 2019 - 4:48:01 PM

Identifiers

  • HAL Id : hal-02081156, version 1

Données associées

Collections

Citation

Guillaume Fertin, Julien Fradin, Christian Komusiewicz. On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. Annual Symposium on Combinatorial Pattern Matching -- CPM 2018, Jul 2018, Qingdao, China. ⟨hal-02081156⟩

Share

Metrics

Record views

13