On the Interplay between Strong Regularity and Graph Densification
Data Structures and Algorithms
2017-03-22 v1 Computer Vision and Pattern Recognition
Abstract
In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our experiments show that this method is quite robust to the natural sparsification of proximity graphs. In addition, this robustness can be enforced by graph densification.
Keywords
Cite
@article{arxiv.1703.07107,
title = {On the Interplay between Strong Regularity and Graph Densification},
author = {Marco Fiorucci and Alessandro Torcinovich and Manuel Curado and Francisco Escolano and Marcello Pelillo},
journal= {arXiv preprint arXiv:1703.07107},
year = {2017}
}
Comments
GbR2017 to appear in Lecture Notes in Computer Science (LNCS)