Toward Quantifying Vertex Similarity in Networks

DOI10.1080/15427951.2013.836581zbMath1461.68167arXiv1110.2813OpenAlexW2963315124MaRDI QIDQ4985357

Charalampos E. Tsourakakis

Publication date: 23 April 2021

Published in: Internet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Spectrally Robust Graph Isomorphism

Uses Software

• EIGIFP
• SimRank
• RolX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remembering Leo Breiman
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• Toward the human genotope
• Graph similarity scoring and matching
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Authoritative sources in a hyperlinked environment
• Assignment Problems
• An optimal algorithm for finding minimal enclosing triangles
• An eigendecomposition approach to weighted graph matching problems
• Archetypal Analysis
• Community structure in social and biological networks
• A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
• An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Computing a nonnegative matrix factorization -- provably
• Nonlinear Dimensionality Reduction

This page was built for publication: Toward Quantifying Vertex Similarity in Networks