๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Experimental studies of algorithms

โœ Scribed by Catherine C. McGeoch

Book ID
112497419
Publisher
Springer
Year
1996
Tongue
English
Weight
80 KB
Volume
29
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Experimental studies on graph drawing al
Experimental studies on graph drawing algorithms
โœ Luca Vismara; Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 1023 KB

Graph drawing plays an important role in the solution of many information visualization problems. Most of the graph drawing algorithms are accompanied by a theoretical analysis of their characteristics, but only extensive experimentations can assess the practical performance of graph drawing algorit

A new measure of clustering effectivenes
A new measure of clustering effectiveness: Algorithms and experimental studies
โœ E.K.F. Dang; R.W.P. Luk; K.S. Ho; S.C.F. Chan; D.L. Lee ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 863 KB

## Abstract We propose a new optimal clustering effectiveness measure, called CS1, based on a combination of clusters rather than selecting a single optimal cluster as in the traditional MK1 measure. For hierarchical clustering, we present an algorithm to compute CS1, defined by seeking the optimal

Cut Tree Algorithms: An Experimental Stu
Cut Tree Algorithms: An Experimental Study
โœ Andrew V Goldberg; Kostas Tsioutsiouliklis ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 654 KB

This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory-Hu algorithm. We also develop problem families for testing cut tr