Publication:4142698
From MaRDI portal
zbMath0366.68040MaRDI QIDQ4142698
Publication date: 1977
Related Items
Finding Hamiltonian circuits in proper interval graphs, A computationally efficient approximation to the nearest neighbor interchange metric, Efficient algorithms for agglomerative hierarchical clustering methods, Optimal algorithms for comparing trees with labeled leaves, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Bibliography on the evaluation of numerical software, On compromising statistical data-bases with a few known elements, Minimum node disjoint path covering for circular-arc graphs, The average performance analysis of a closest‐pair algorithm, Optimal search trees and length restricted codes, Bewertung heuristischer Methoden
Uses Software