Skip to Main content Skip to Navigation
Journal articles

Finding Shortest Paths Between Graph Colourings

Document type :
Journal articles
Complete list of metadata

https://hal.univ-lorraine.fr/hal-03242343
Contributor : Jérémie Schutz Connect in order to contact the contributor
Submitted on : Monday, May 31, 2021 - 8:29:31 AM
Last modification on : Tuesday, July 20, 2021 - 3:15:04 AM

Links full text

Identifiers

Collections

Citation

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma. Finding Shortest Paths Between Graph Colourings. Algorithmica, Springer Verlag, 2016, 75 (2), pp.295-321. ⟨10.1007/s00453-015-0009-7⟩. ⟨hal-03242343⟩

Share

Metrics

Record views

16