Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Approximating Symmetric Relations by Equivalence Relations - MaRDI portal

Approximating Symmetric Relations by Equivalence Relations

From MaRDI portal
Publication:5337832

DOI10.1137/0112071zbMath0129.16003OpenAlexW2049241046MaRDI QIDQ5337832

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




Related Items (25)

NP-hard problems in hierarchical-tree clusteringCluster Editing$2$-Approximation algorithms for two graph clustering problemsGraph clustering with a constraint on cluster sizesA PTAS for the Cluster Editing Problem on Planar GraphsUnnamed ItemThe median procedure in cluster analysis and social choice theoryThe complexity of computing metric distances between partitionsBootstrap clustering for graph partitioningOn a semi-superwized graph clustering problemOptimal clustering of multipartite graphsUnifying Some Association Criteria Between Partitions by Using Relational MatricesBlock 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))Consensus of partitions: a constructive approachNoising methods for a clique partitioning problemApproximation algorithms for graph approximation problemsThe Branch and Cut Method for the Clique Partitioning ProblemContraction Methods for Correlation Clustering: The Order is ImportantApplication of the “descent with mutations” metaheuristic to a clique partitioning problemDistances between treesA literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysisUnnamed ItemClustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problemComparison of Linear Modularization Criteria Using the Relational Formalism, an Approach to Easily Identify Resolution LimitCloser




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