Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin,
Add to Reading List
Document Date: 2017-04-12 10:30:42
Open Document
File Size: 213,27 KB
Share Result on Facebook
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin,