A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Edge clustering centrality measures the frequency an edge appears across the closed neighborhoods over all vertices. This problem is analogous to the structural graph theory problem of finding the maximum sized book graph (K2 ∨ mK1, m ≥ 1) in a given graph.dblp:journals/bullica/LindGMVN17 fatcat:6qlbvj4hiffwnm6vtudeqswqoi