Non-backtracking cycles: length spectrum theory and graph mining applications

Non-backtracking cycles: length spectrum theory and graph mining applications

Abstract Graph distance and graph embedding are two fundamental tasks in graph mining. For graph distance, determining the structural dissimilarity between networks is an ill-defined problem, as there is no canonical way to compare two networks. Indeed, many of the existing approaches for network co...

Descripció completa

Dades bibliogràfiques
Autors principals: Leo Torres, Pablo Suárez-Serrato, Tina Eliassi-Rad
Format: Article
Idioma:English
Publicat: SpringerOpen 2019-06-01
Col·lecció:Applied Network Science
Matèries:
Graph distance
Graph embedding
Algebraic topology
Length spectrum
Accés en línia:http://link.springer.com/article/10.1007/s41109-019-0147-y

Internet

http://link.springer.com/article/10.1007/s41109-019-0147-y

Ítems similars