EUVIMEDEUVIMED entdecken
Crossref

On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle

Martijn van Ee

Theoretical Computer Science · 2026-06 · 1076 · 115963

DOI: 10.1016/j.tcs.2026.115963 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Martijn van Ee. Die Arbeit nennt 37 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Ee, M. V. (2026). On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle. Theoretical Computer Science, 1076, 115963. https://doi.org/10.1016/j.tcs.2026.115963

Vancouver

Ee MV. On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle. Theoretical Computer Science. 2026;1076:115963. doi:10.1016/j.tcs.2026.115963

BibTeX
@article{Ee2026,
  author = {Ee, Martijn van},
  title = {On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1076},
  pages = {115963},
  doi = {10.1016/j.tcs.2026.115963}
}
Kostenlos starten →