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

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

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

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

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

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

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