I have calculated an "influence score" on an unweighted and weighted graph. I used BFS algorithm for the unweighted graph and Dijkstra's algorithm for the weighted graph.

I have calculated an "influence score" on an unweighted and weighted graph. I used BFS algorithm for the unweighted graph and Dijkstra's algorithm for the weighted graph.

This study proposes a method that combines the Wasserstein non-negative matrix factorization (W-NMF) with line graphs to obtain low-dimensional representations of multi-layered graphs. A line graph is ...

Trophic coherence can be regarded as a measure of how neatly a graph can be divided into distinct layers, whereas non-normality is a measure of how unlike a matrix is with its transpose. We explore ...