Low time complexity algorithms for path computation in Cayley Graphs
- DOI
- 10.1016/j.dam.2018.12.005
- Published
- 2019-04
- Container
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- 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.
- supportingDOI resolves: A matching record was returned by Crossref.
- 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.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- 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.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1016/j.dam.2018.12.005,
title = {Low time complexity algorithms for path computation in Cayley Graphs},
author = {D. Aguirre-Guerrero and G. Ducoffe and L. Fàbrega and P. Vilà and D. Coudert},
year = {2019},
journal = {Discrete Applied Mathematics},
doi = {10.1016/j.dam.2018.12.005},
url = {https://doi.org/10.1016/j.dam.2018.12.005}
}RIS
TY - JOUR TI - Low time complexity algorithms for path computation in Cayley Graphs AU - D. Aguirre-Guerrero AU - G. Ducoffe AU - L. Fàbrega AU - P. Vilà AU - D. Coudert PY - 2019 JO - Discrete Applied Mathematics DO - 10.1016/j.dam.2018.12.005 UR - https://doi.org/10.1016/j.dam.2018.12.005 ER -
APA
Aguirre-Guerrero, D., Ducoffe, G., Fàbrega, L., Vilà, P., & Coudert, D. (2019). Low time complexity algorithms for path computation in Cayley Graphs. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2018.12.005
Source records
- crossref · retrieved 2026-09-26T13:45:22.452Z