Separating Structure from Noise in Large Graphs Using the Regularity Lemma
Authors:
- Marco FiorucciMarco Fiorucci
- Francesco PelosinFrancesco Pelosin
- Marcello PelilloMPMarcello Pelillo
- 1 February 2020
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 98
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Recent advances in graph-based pattern recognition with applications in document analysisPattern Recognition, 2011
- Geometric characterization and clustering of graphs using heat kernel embeddingsImage and Vision Computing, 2010
- Graph characteristics from the heat kernel tracePattern Recognition, 2009
- A generative model for graph matching and embeddingComputer Vision and Image Understanding, 2009
- Graph clusteringComputer Science Review, 2007
- Graph evolutionACM Transactions on Knowledge Discovery From Data, 2007
- Which graphs are determined by their spectrum?Linear Algebra and its Applications, 2003
- Quick Approximation to Matrices and ApplicationsCombinatorica, 1999
- The Algorithmic Aspects of the Regularity LemmaJournal of Algorithms, 1994
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976