Optimal Path Embedding in the Exchanged Crossed Cube
Research article (Journal of Computer Science and Technology, 2017) · cited 11× · AI/ML
Press Enter · cited answer in seconds
.xyz
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
4ort.xyz Knowledge Graph. (2026). Optimal Path Embedding in the Exchanged Crossed Cube. Retrieved May 24, 2026, from https://4ort.xyz/entity/optimal-path-embedding-in-the-exchanged-crossed-cube
“Optimal Path Embedding in the Exchanged Crossed Cube.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/optimal-path-embedding-in-the-exchanged-crossed-cube.
@misc{4ortxyz_optimal-path-embedding-in-the-exchanged-crossed-cube_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Optimal Path Embedding in the Exchanged Crossed Cube}}, year = {2026}, url = {https://4ort.xyz/entity/optimal-path-embedding-in-the-exchanged-crossed-cube}, note = {Accessed: 2026-05-24}}
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Optimal Path Embedding in the Exchanged Crossed Cube — https://4ort.xyz/entity/optimal-path-embedding-in-the-exchanged-crossed-cube (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/optimal-path-embedding-in-the-exchanged-crossed-cube · Last refreshed: