Separator theorems for minor-free and shallow minor-free graphs with applications
C Wulff-Nilsen - 2011 IEEE 52nd Annual Symposium on …, 2011 - ieeexplore.ieee.org
Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and
showed that a K h-minor free graph with n vertices has a separator of size at most h 3/2√ n …
showed that a K h-minor free graph with n vertices has a separator of size at most h 3/2√ n …
Single source shortest paths in H-minor free graphs
R Yuster - Theoretical computer science, 2010 - Elsevier
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in directedH-
minor free graphs. For every fixed H, if G is a graph with n vertices having integer edge …
minor free graphs. For every fixed H, if G is a graph with n vertices having integer edge …
Faster shortest path algorithm for H-minor free graphs with negative edge weights
C Wulff-Nilsen - arxiv preprint arxiv:1008.1048, 2010 - arxiv.org
Let $ H $ be a fixed graph and let $ G $ be an $ H $-minor free $ n $-vertex graph with
integer edge weights and no negative weight cycles reachable from a given vertex $ s $. We …
integer edge weights and no negative weight cycles reachable from a given vertex $ s $. We …