Clustering in trees: Optimizing cluster sizes and number of subtrees.
Hambrusch, Susanne E.; Liu, Chuan-Ming; Lim, Hyeong-Seok
Journal of Graph Algorithms and Applications (2000)
- Volume: 4, Issue: 4, page 26 p.-26 p.
- ISSN: 1526-1719
Access Full Article
topHow to cite
topHambrusch, Susanne E., Liu, Chuan-Ming, and Lim, Hyeong-Seok. "Clustering in trees: Optimizing cluster sizes and number of subtrees.." Journal of Graph Algorithms and Applications 4.4 (2000): 26 p.-26 p.. <http://eudml.org/doc/48893>.
@article{Hambrusch2000,
author = {Hambrusch, Susanne E., Liu, Chuan-Ming, Lim, Hyeong-Seok},
journal = {Journal of Graph Algorithms and Applications},
keywords = {clusters},
language = {eng},
number = {4},
pages = {26 p.-26 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Clustering in trees: Optimizing cluster sizes and number of subtrees.},
url = {http://eudml.org/doc/48893},
volume = {4},
year = {2000},
}
TY - JOUR
AU - Hambrusch, Susanne E.
AU - Liu, Chuan-Ming
AU - Lim, Hyeong-Seok
TI - Clustering in trees: Optimizing cluster sizes and number of subtrees.
JO - Journal of Graph Algorithms and Applications
PY - 2000
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 4
IS - 4
SP - 26 p.
EP - 26 p.
LA - eng
KW - clusters
UR - http://eudml.org/doc/48893
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.