Journal Articles
Algorithmica
Year : 2016
Jérémie Schutz : Connect in order to contact the contributor
https://hal.univ-lorraine.fr/hal-03242343
Submitted on : Monday, May 31, 2021-8:29:31 AM
Last modification on : Wednesday, April 6, 2022-8:54:04 PM
Dates and versions
Identifiers
- HAL Id : hal-03242343 , version 1
- ARXIV : 1403.6347
- DOI : 10.1007/s00453-015-0009-7
Cite
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma. Finding Shortest Paths Between Graph Colourings. Algorithmica, 2016, 75 (2), pp.295-321. ⟨10.1007/s00453-015-0009-7⟩. ⟨hal-03242343⟩
Collections
21
View
0
Download