Root Lattices are Efficiently Generated
From MaRDI portal
Publication:4335565
DOI10.1142/S0218196797000046zbMath0866.68080OpenAlexW2031764998MaRDI QIDQ4335565
Anil M. Shende, Dayanand S. Rajan
Publication date: 6 July 1997
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196797000046
directed graphEuclidean metricroot latticesmassively parallel computersrelevant vectorsshortest path metric
This page was built for publication: Root Lattices are Efficiently Generated