CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure
Authors
Guillaume Fertin
Julien Fradin
Christian Komusiewicz
Publication date
1 January 2018
Publisher
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Doi
Cite
Abstract
International audienc
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Hal-Diderot
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:hal-02081156v1
Last time updated on 14/04/2021
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:8693
Last time updated on 19/06/2018
HAL-Univ-Nantes
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:hal-02081156v1
Last time updated on 18/04/2019