Partition-distance: A problem and class of perfect graphs arising in clustering
From MaRDI portal
Publication:1603544
DOI10.1016/S0020-0190(01)00263-0zbMath1013.68142OpenAlexW1996134775MaRDI QIDQ1603544
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00263-0
geneticspartitioningclusteringcombinatorial problemsgraph algorithmsperfect graphassignment problemnode cover
Related Items (20)
Bayesian pedigree inference with small numbers of single nucleotide polymorphisms via a factor-graph representation ⋮ On constructing an optimal consensus clustering from multiple clusterings ⋮ A simulated annealing algorithm for maximum likelihood pedigree reconstruction ⋮ Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph ⋮ Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ An efficient algorithm for computing the distance between close partitions ⋮ Ensemble clustering by means of clustering embedding in vector spaces ⋮ On the metrization of the infinite partition lattice ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Consensus of partitions: a constructive approach ⋮ Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction ⋮ An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring ⋮ Set covering approach for reconstruction of sibling relationships ⋮ Detection of local tourism systems by threshold accepting ⋮ On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests ⋮ A commentary on some recent methods in sibling group reconstruction based on set coverings ⋮ A search space ``cartography for guiding graph coloring heuristics ⋮ Suppression distance computation for hierarchical clusterings
Cites Work
This page was built for publication: Partition-distance: A problem and class of perfect graphs arising in clustering
