Finding Shortest Paths Between Graph Colourings

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma

Open source

DOI: 10.1007/s00453-015-0009-7
Published: 2015-05-12
Container: Algorithmica
Publisher: Springer Science and Business Media LLC
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s00453-015-0009-7,
  title = {Finding Shortest Paths Between Graph Colourings},
  author = {Matthew Johnson and Dieter Kratsch and Stefan Kratsch and Viresh Patel and Daniël Paulusma},
  year = {2015},
  journal = {Algorithmica},
  doi = {10.1007/s00453-015-0009-7},
  url = {https://doi.org/10.1007/s00453-015-0009-7}
}

RIS

TY  - JOUR
TI  - Finding Shortest Paths Between Graph Colourings
AU  - Matthew Johnson
AU  - Dieter Kratsch
AU  - Stefan Kratsch
AU  - Viresh Patel
AU  - Daniël Paulusma
PY  - 2015
JO  - Algorithmica
DO  - 10.1007/s00453-015-0009-7
UR  - https://doi.org/10.1007/s00453-015-0009-7
ER  -

APA

Johnson, M., Kratsch, D., Kratsch, S., Patel, V., & Paulusma, D. (2015). Finding Shortest Paths Between Graph Colourings. Algorithmica. https://doi.org/10.1007/s00453-015-0009-7

Source records

crossref · retrieved 2026-09-26T02:40:04.190Z