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]

Authors

Martijn van Ee

This author has not been identified. Look up 'Martijn van Ee' in Google