Finding Optimal Triadic Transformational Spaces with Dijkstra’s Shortest Path Algorithm

DOI10.1007/978-3-319-20603-5_12zbMath1320.00019OpenAlexW2220553782MaRDI QIDQ2942312

Ryan Groves

Publication date: 20 August 2015

Published in: Mathematics and Computation in Music (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20603-5_12

zbMATH Keywords

shortest path algorithmneo-Riemannian theorycomputational musicologytransformational spaces

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Mathematics and music (00A65)

Cites Work

• A note on two problems in connexion with graphs

This page was built for publication: Finding Optimal Triadic Transformational Spaces with Dijkstra’s Shortest Path Algorithm