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...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs: Leo Torres, Pablo Suárez-Serrato, Tina Eliassi-Rad
Formaat: Artikel
Taal:English
Gepubliceerd in: SpringerOpen 2019-06-01
Reeks:Applied Network Science
Onderwerpen:
Graph distance
Graph embedding
Algebraic topology
Length spectrum
Online toegang:http://link.springer.com/article/10.1007/s41109-019-0147-y

Internet

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

Gelijkaardige items