We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
The effective management of a supply chain requires performance measures that accurately represent the underlying structure of the supply chain. Measures such as delivery performa...
Alfred L. Guiffrida, Robert A. Rzepka, Mohamad Y. ...