d Abstract) Andrea Cal`i2,1 , Georg Gottlob1,2 , and Thomas Lukasiewicz1, 1 Computing Laboratory, University of Oxford, UK firstname.lastname@comlab.ox.ac.uk 2 Oxford-Man Institute...
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...