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

DOI10.1016/S0020-0190(01)00263-0zbMATH Open1013.68142OpenAlexW1996134775MaRDI QIDQ1603544FDOQ1603544

Authors: Dan Gusfield 

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

Recommendations

• An efficient algorithm for computing the distance between close partitions
• Distances in graph partitioning
• Suppression distance computation for hierarchical clusterings
• A Generalized Distance in Graphs and Centered Partitions
• Partitions of Graphs

zbMATH Keywords

geneticsclusteringassignment problemgraph algorithmsperfect graphcombinatorial problemspartitioningnode cover

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Classes: A Survey
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)

Cited In (24)

• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• On the metrization of the infinite partition lattice
• Transfer distance between partitions and search of dense zones in graphs
• Set covering approach for reconstruction of sibling relationships
• Distances in graph partitioning
• Clustering and domination in perfect graphs
• A commentary on some recent methods in sibling group reconstruction based on set coverings
• A search space ``cartography for guiding graph coloring heuristics
• Bayesian pedigree inference with small numbers of single nucleotide polymorphisms via a factor-graph representation
• Graphs, \(L_1\)-metrics and clustering
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• A simulated annealing algorithm for maximum likelihood pedigree reconstruction
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
• Ensemble clustering by means of clustering embedding in vector spaces
• Detection of local tourism systems by threshold accepting
• Consensus of partitions: a constructive approach
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
• On constructing an optimal consensus clustering from multiple clusterings
• An efficient algorithm for computing the distance between close partitions
• On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• Suppression distance computation for hierarchical clusterings

This page was built for publication: Partition-distance: A problem and class of perfect graphs arising in clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603544)