Peer reviewedERIC Number: EJ349571
Record Type: Journal
Publication Date: 1987
Pages: N/A
Abstractor: N/A
ISBN: N/A
ISSN: N/A
EISSN: N/A
Optimal Clustering in Graphs with Weighted Edges: A Unified Approach to the Threshold Problem.
Goetschel, Roy; Voxman, William
Journal of the American Society for Information Science, v38 n1 p13-20 Jan 1987
Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory, two methods of partitioning V are examined: selecting threshold values and applying them to a maximal weighted spanning forest, and using a parametric linear program to obtain a most adhesive partition. (Author/EM)
Publication Type: Journal Articles; Reports - Research
Education Level: N/A
Audience: Researchers
Language: English
Sponsor: N/A
Authoring Institution: N/A
Grant or Contract Numbers: N/A
