105 citations · 130 across the 18 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2008
Single source shortest paths in -minor free graphs
Raphael Yuster
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in \emph{-minor free} graphs. For every fixed , if is a graph with vertices having integer…
cs.DS2006★ 6 cited
Finding heaviest H-subgraphs in real weighted graphs, with applications
Virginia Vassilevska, Ryan Williams, Raphael Yuster
For a graph G with real weights assigned to the vertices (edges), the MAX H-SUBGRAPH problem is to find an H-subgraph of G with maximum total weight, if one exists. The all-pairs M…