Graph Embeddings and Simplicial Maps Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures , 1993, pp. 311317. -->
- DOI
- 10.1007/s002240000041
- Published
- 1997-01-01
- Container
- Theory of Computing Systems
- 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.
- 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.1007/s002240000041,
title = {Graph Embeddings and Simplicial Maps Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures , 1993, pp. 311317. --\>},
author = {L. S. Heath},
year = {1997},
journal = {Theory of Computing Systems},
doi = {10.1007/s002240000041},
url = {https://doi.org/10.1007/s002240000041}
}RIS
TY - JOUR TI - Graph Embeddings and Simplicial Maps Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures , 1993, pp. 311317. --> AU - L. S. Heath PY - 1997 JO - Theory of Computing Systems DO - 10.1007/s002240000041 UR - https://doi.org/10.1007/s002240000041 ER -
APA
Heath, L. S. (1997). Graph Embeddings and Simplicial Maps Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures , 1993, pp. 311317. -->. Theory of Computing Systems. https://doi.org/10.1007/s002240000041
Source records
- crossref · retrieved 2026-11-10T06:35:17.529Z