Finding Shortest Paths Between Graph Colourings
Crossref DOI link: https://doi.org/10.1007/s00453-015-0009-7
Published Online: 2015-05-12
Published Print: 2016-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Johnson, Matthew
Kratsch, Dieter
Kratsch, Stefan
Patel, Viresh
Paulusma, Daniƫl
Text and Data Mining valid from 2015-05-12