scientific article; zbMATH DE number 3571501

zbMath0366.68040MaRDI QIDQ4142698

Bruce W. Weide

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ The average performance analysis of a closest‐pair algorithm ⋮ Optimal search trees and length restricted codes ⋮ 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 ⋮ Finding Hamiltonian circuits in proper interval graphs ⋮ A computationally efficient approximation to the nearest neighbor interchange metric ⋮ Efficient algorithms for agglomerative hierarchical clustering methods ⋮ Bewertung heuristischer Methoden ⋮ Optimal algorithms for comparing trees with labeled leaves

Uses Software

• Algorithm 447