The following pages link to (Q4142698):
Displayed 11 items.
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Efficient algorithms for agglomerative hierarchical clustering methods (Q1057599) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- On compromising statistical data-bases with a few known elements (Q1256850) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
- Optimal search trees and length restricted codes (Q3867198) (← links)
- Bewertung heuristischer Methoden (Q3941214) (← links)