Partition-distance: A problem and class of perfect graphs arising in clustering

Information Processing Letters

Volumn 82, Issue 3, 2002, Pages 159-164

  Gusfield, Dan ^a  

^a University of California   (United States)

Author keywords

Assignment problem; Clustering; Combinatorial problems; Genetics; Graph algorithms; Node cover; Partitioning; Perfect graph

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; GENETIC ENGINEERING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ASSIGNMENT PROBLEM; PARTITIONING;

GRAPH THEORY;

EID: 0037118191     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00263-0     Document Type: Article

References (7)

1. Estimation of single generation sibling relationships based on DNA markers
2. Graph Classes - A Survey
3. The ellipsoid method and its consequences in combinatorial optimization