For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
16
views
6
references
 Top references
cited by
42
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,210
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

      Author(s): ,
      Publication date Created:
      Publication date (Print):
      Journal: Theoretical Computer Science
      Publisher: Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references6

          • Record: found
          • Abstract: not found
          • Article: not found

          Relationships between nondeterministic and deterministic tape complexities

          Walter J. Savitch (1970)
          Article 0 comments Cited 114 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

            Erik D. Demaine, Robert Hearn (2005)
            Article 0 comments Cited 56 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Connectedness of the graph of vertex-colourings

              Jan van den Heuvel, Luis E Cereceda, Matthew J. Johnson (2008)
              Article 0 comments Cited 37 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: Theoretical Computer Science
                Abbreviated Title: Theoretical Computer Science
                Publisher: Elsevier BV
                ISSN (Print): 03043975
                Publication date Created: November 2009
                Publication date (Print): November 2009
                Volume: 410
                Issue: 50
                Pages: 5215-5226
                Article
                DOI: 10.1016/j.tcs.2009.08.023
                SO-VID: 211e1214-8702-4da2-9453-cf315fe034f3
                Copyright © © 2009
                License:

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Data availability:

                Comments

                Comment on this article