M. Johnson
Finding Shortest Paths Between Graph Colourings
Johnson, M.; Kratsch, D.; Kratsch, S.; Patel, V.; Paulusma, D.
Authors
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 |
Files
Accepted Conference Proceeding
(338 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-13524-3_19
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search