Finding Shortest Paths Between Graph Colourings - Université de Lorraine Access content directly
Journal Articles Algorithmica Year : 2016

Finding Shortest Paths Between Graph Colourings

Matthew Johnson
Stefan Kratsch
  • Function : Author
Viresh Patel
  • Function : Author
Daniël Paulusma

Domains

Automatic

Dates and versions

hal-03242343 , version 1 (31-05-2021)

Identifiers

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⟩
19 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More