On measuring edge importance[go to overview]
Not all edges are of the same importance in a graph. However, previous research works have been focusing on vertices rather than edges. We propose a method that can measure the importance of edges, given a undirected simple graph (edges are unweighted). Such method can be easily extended to work with directed graphs as well. We also show evaluation results, how we identify important edges in a graph. Applications of the method are to be discussed.
12.01.17 - 10:15