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...
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
SpringerOpen
2019-06-01
|
| سلاسل: | Applied Network Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://link.springer.com/article/10.1007/s41109-019-0147-y |