Finding Shortest Paths Between Graph Colourings

Johnson, M.; Kratsch, D.; Kratsch, S.; Patel, V.; Paulusma, D.

doi:10.1007/978-3-319-13524-3_19

Finding Shortest Paths Between Graph Colourings

Johnson, M.; Kratsch, D.; Kratsch, S.; Patel, V.; Paulusma, D.

Authors

M. Johnson

D. Kratsch

S. Kratsch

V. Patel

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Contributors

Marek Cygan
Editor

Pinar Heggernes
Editor

Citation

Johnson, M., Kratsch, D., Kratsch, S., Patel, V., & Paulusma, D. (2014). Finding Shortest Paths Between Graph Colourings. In M. Cygan, & P. Heggernes (Eds.), 9th International Symposium, IPEC 2014, Wroclaw, Poland, 10-12 September 2014 ; revised selected papers (221-233). https://doi.org/10.1007/978-3-319-13524-3_19

Conference Name	9th International Symposium, IPEC 2014
Conference Location	Wroclaw, Poland
Publication Date	Jan 1, 2014
Deposit Date	Dec 20, 2014
Publicly Available Date	Jan 16, 2015
Pages	221-233
Series Title	Lecture notes in computer science
Series Number	8894
Series ISSN	0302-9743,1611-3349
Book Title	9th International Symposium, IPEC 2014, Wroclaw, Poland, 10-12 September 2014 ; revised selected papers.
ISBN	9783319135236
DOI	https://doi.org/10.1007/978-3-319-13524-3_19
Public URL	https://durham-repository.worktribe.com/output/1153128