Approximating Symmetric Relations by Equivalence Relations

DOI10.1137/0112071MaRDI QIDQ5337832zbMATH OpenOpenAlexFDO

Authors C. T. Zahn

Publication date 1964

Published in Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0112071

zbMATH Keywords

topology

Cited in

(30)

• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
• NP-hard problems in hierarchical-tree clustering
• The median procedure in cluster analysis and social choice theory
• The complexity of computing metric distances between partitions
• Consensus of partitions: a constructive approach
• Distances between trees
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Noising methods for a clique partitioning problem
• Graph clustering with a constraint on cluster sizes
• A PTAS for the Cluster Editing Problem on Planar Graphs
• Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
• Unifying some association criteria between partitions by using relational matrices
• Approximation algorithms for approximating graphs with bounded number of connected components
• The branch and cut method for the clique partitioning problem
• Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit
• 2-approximation algorithms for two graph clustering problems
• Computational complexity of the problem of approximation by graphs with connected components of bounded size
• On a semi-supervised graph clustering problem
• Contraction methods for correlation clustering: the order is important
• Application of the ``descent with mutations metaheuristic to a clique partitioning problem
• Cluster editing
• Bootstrap clustering for graph partitioning
• scientific article; zbMATH DE number 7746258 (Why is no real title available?)
• On cluster editing problem with clusters of small sizes
• Approximation algorithms for graph clustering problems with clusters of bounded size
• Clustering complexity and an approximation algorithm for a version of the cluster editing problem
• Cluster editing on cographs and related classes
• Approximation algorithms for the cluster editing problem with small clusters
• Closer
• Optimal clustering of multipartite graphs

This page was built for publication: Approximating Symmetric Relations by Equivalence Relations

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