Motif and Hypergraph Correlation Clustering

DOI10.1109/TIT.2019.2940246zbMath1448.05150arXiv1811.02089OpenAlexW2973019811MaRDI QIDQ5123914

Pan Li, Olgica Milenković, Gregory J. Puleo

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.02089

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithm for the capacitated correlation clustering problem with penalties ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Structural parameterization of cluster deletion ⋮ A framework for second-order eigenvector centralities and clustering coefficients ⋮ Approximation algorithms for the capacitated correlation clustering problem with penalties

This page was built for publication: Motif and Hypergraph Correlation Clustering