120 citations · 232 across the 12 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 7 cited
A Centrality Measure for Cycles and Subgraphs II
P-L. Giscard, R. C. Wilson
In a recent work we introduced a measure of importance for groups of vertices in a complex network. This centrality for groups is always between 0 and 1 and induces the eigenvector…
cs.DS2016★ 14 cited
A general purpose algorithm for counting simple cycles and simple paths of any length
Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson
We describe a general purpose algorithm for counting simple cycles and simple paths of any length on a (weighted di)graph on vertices and edges, achieving a time com…