Finding optimal triadic transformational spaces with Dijkstra's shortest path algorithm

DOI10.1007/978-3-319-20603-5_12MaRDI QIDQ2942312zbMATH OpenOpenAlexFDO

Authors 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

computational musicologyneo-Riemannian theoryshortest path algorithmtransformational spaces

Mathematics Subject Classification ID

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

Recommendations

• The Irrelative System in Tonal Harmony
• A graph theoretic approach to tonal modulation
• Chordal and timbral morphologies using Hamiltonian cycles
• Utilizing computer programming to analyze post-tonal music: contour analysis of four works for solo flute
• Algebra of harmony: transformations of just consonances

Cites work

• A note on two problems in connexion with graphs

Cited in

(7)

• Three-dimensional Euclidean distance transformation and its application to shortest path planning
• Music genomics: determining musical similarities with seriation algorithms
• Utilizing computer programming to analyze post-tonal music: contour analysis of four works for solo flute
• Exploding the monochord: an intuitive spatial representation of microtonal relational structures
• Catastrophe theory: an enhanced structural and ontological space in music composition
• Non-linear circles and the triple harp: creating a microtonal harp
• scientific article; zbMATH DE number 2202937 (Why is no real title available?)

This page was built for publication: Finding optimal triadic transformational spaces with Dijkstra's shortest path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942312)