• Publications
  • Influence
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs
TLDR
We show that every 3-connected graph has a nonseparating ear decomposition, and show that three independent spanning trees can be found in O ( VE ) time. Expand
  • 162
  • 15
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
TLDR
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of n vertices. Expand
  • 121
  • 11
  • PDF
An O(|V|³) Algorithm for Finding Maximum Flows in Networks
TLDR
An O(V cubed) algorithm is given for finding maximum flow in capacitated networks and is being posted here to make it accessible to all in electronic form. Expand
  • 222
  • 6
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
TLDR
This paper describes an output-sensitive scheme to construct the visibility graph of a simple polygon with m obstacles and n vertices in optimal O(|E| +T + m log n ) time where |E| is the size of a visibility graph and T is the time required to triangulate the simple Polygon with obstacles. Expand
  • 24
  • 3
Generic Cuts: An Efficient Algorithm for Optimal Inference in Higher Order MRF-MAP
TLDR
We propose a new algorithm called Generic Cuts for computing optimal solutions to 2 label MRF-MAP problems with higher order clique potentials satisfying submodularity. Expand
  • 18
  • 3
  • PDF
An Efficient Graph Cut Algorithm for Computer Vision Problems
TLDR
We present here a new algorithm for graph cuts which not only exploits the structural properties inherent in image based grid graphs but also combines the basic paradigms of max-flow theory in a novel way. Expand
  • 15
  • 2
  • PDF
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
TLDR
In this paper we describe two interconnection networks for parallel processing, namely the Orthogonal trees network and the orthogonal tree cycles (OTN and OTC). Expand
  • 114
  • 1
  • PDF
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
TLDR
The problem of determining the Euclidean shortest path between two points in the presence of m simple polygonal obstacles is studied. Expand
  • 80
  • 1
Analysis of Preflow Push Algorithms for Maximum Network Flow
TLDR
We study the class of preflow push algorithms recently introduced by Goldberg and Tarjan for solving the maximum network flow problem on a weighted digraph G(V,E) and show that this bound is tight by constructing a parametrized worst case network. Expand
  • 70
  • 1
  • PDF