Finding Shortest Paths Between Graph Colourings (2015)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s00453-015-0009-7
Publication URI: http://dx.doi.org/10.1007/s00453-015-0009-7
Type: Journal Article/Review
Parent Publication: Algorithmica
Issue: 2