On the complexity of finding central configurations of the graph-generalized ( n 2 - 1 ) -puzzle

Martijn van Ee. On the complexity of finding central configurations of the graph-generalized ( n 2 - 1 ) -puzzle. Theoretical Computer Science, 1076:115963, 2026. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.