Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...