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, December). Finding Shortest Paths Between Graph Colourings. Presented at 9th International Symposium, IPEC 2014, Wroclaw, Poland

Presentation Conference Type	Conference Paper (published)
Conference Name	9th International Symposium, IPEC 2014
Publication Date	Jan 1, 2014
Deposit Date	Dec 20, 2014
Publicly Available Date	Jan 16, 2015
Print ISSN	0302-9743
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