"The Maximum Colorful Arborescence problem: How (computationally) hard can ..."

Guillaume Fertin, Julien Fradin, Géraldine Jean (2021)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2020.11.021

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/FertinFJ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FertinFJ21
Guillaume Fertin, Julien Fradin, Géraldine Jean:
The Maximum Colorful Arborescence problem: How (computationally) hard can it be? Theor. Comput. Sci. 852: 104-120 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.