Graphs and algorithms
Journal of the ACM (JACM)
A more general algorithm for computing closed semiring costs between vertices of a directed graph
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Computational geometric aspects of rhythm, melody, and voice-leading
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We describe two algorithms for solving the maximum convolution problem, i.e. the calculation of c"k: = max {a"k"-"i + b"i@? 0 =