Many applications in network analysis require the computation of the network's Laplacian pseudo-inverse - e.g., Topological centrality in social networks or estimating commute times in electrical ...

In this paper we propose a graph cut method for solving a multi-label linear inverse problem with an arbitrary system matrix. Graph cuts are efficient methods for solving pixel-labeling and early ...