On the Interplay Between Strong Regularity and Graph Densification

DOI10.1007/978-3-319-58961-9_15zbMath1489.68191arXiv1703.07107OpenAlexW2604396438MaRDI QIDQ5082152

Marcello Pelillo, Manuel Curado, Marco Fiorucci, F. Escolano, Alessandro Torcinovich

Publication date: 15 June 2022

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmsregular partitioncommute timegraph densification

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds of tower type for Szemerédi's uniformity lemma
• Graph densification
• Hitting and commute times in large graphs are often misleading
• The Algorithmic Aspects of the Regularity Lemma
• Efficient testing of large graphs

This page was built for publication: On the Interplay Between Strong Regularity and Graph Densification