"Finding Shortest Paths Between Graph Colourings."

Matthew Johnson et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S00453-015-0009-7

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/0001KKPP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/0001KKPP16
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.