Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 17053 results
Sort by: relevance publication year

A Fast Parametric Maximum Flow Algorithm and Applications

JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing

Authors: Giorgio Gallo | Michael D. Grigoriadis | Robert E. Tarjan

Improved Time Bounds for the Maximum Flow Problem

JOURNAL ARTICLE published October 1989 in SIAM Journal on Computing

Authors: Ravindra K. Ahuja | James B. Orlin | Robert E. Tarjan

Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem

REPORT published 1 October 1988

Authors: Andrew V. Goldberg | Michael D. Grigoriadis | Robert E. Tarjan

Parametric Maximum Flow Algorithms for Fast Total Variation Minimization

JOURNAL ARTICLE published January 2009 in SIAM Journal on Scientific Computing

Authors: Donald Goldfarb | Wotao Yin

Faster Scaling Algorithms for Network Problems

JOURNAL ARTICLE published October 1989 in SIAM Journal on Computing

Authors: Harold N. Gabow | Robert E. Tarjan

Analysis of Preflow Push Algorithms for Maximum Network Flow

JOURNAL ARTICLE published December 1989 in SIAM Journal on Computing

Authors: J. Cheriyan | S. N. Maheshwari

Amortized Analysis of Algorithms for Set Union with Backtracking

JOURNAL ARTICLE published February 1989 in SIAM Journal on Computing

Authors: Jeffery Westbrook | Robert E. Tarjan

A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs

JOURNAL ARTICLE published August 1989 in SIAM Journal on Computing

Authors: Barbara B. Simons | Manfred K. Warmuth

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

JOURNAL ARTICLE published March 1991 in Mathematical Programming

Authors: Andrew V. Goldberg | Michael D. Grigoriadis | Robert E. Tarjan

A Fast Algorithm for Trummer’s Problem

JOURNAL ARTICLE published January 1987 in SIAM Journal on Scientific and Statistical Computing

Authors: A. Gerasoulis | M. D. Grigoriadis | Liping Sun

Finding a Maximum Independent Set

JOURNAL ARTICLE published September 1977 in SIAM Journal on Computing

Authors: Robert Endre Tarjan | Anthony E. Trojanowski

Finding an Approximate Maximum

JOURNAL ARTICLE published April 1989 in SIAM Journal on Computing

Authors: N. Alon | Y. Azar

A Randomized Maximum-Flow Algorithm

JOURNAL ARTICLE published April 1995 in SIAM Journal on Computing

Authors: Joseph Cheriyan | Torben Hagerup

Very Fast Parallel Polynomial Arithmetic

JOURNAL ARTICLE published October 1989 in SIAM Journal on Computing

Authors: Wayne Eberly

Fast Fourier Transforms for Metabelian Groups

JOURNAL ARTICLE published June 1989 in SIAM Journal on Computing

Authors: Michael Clausen

An Efficient Parallel Biconnectivity Algorithm

JOURNAL ARTICLE published November 1985 in SIAM Journal on Computing

Authors: Robert E. Tarjan | Uzi Vishkin

Fast Algorithms for Finding Nearest Common Ancestors

JOURNAL ARTICLE published May 1984 in SIAM Journal on Computing

Authors: Dov Harel | Robert Endre Tarjan

Ratio Estimators are Maximum-Likelihood Estimators for Non-Context-Free Grammars

JOURNAL ARTICLE published October 1989 in SIAM Journal on Computing

Authors: Keith Humenik

Network Flow and Testing Graph Connectivity

JOURNAL ARTICLE published December 1975 in SIAM Journal on Computing

Authors: Shimon Even | R. Endre Tarjan

An $o(n^3 )$-Time Maximum-Flow Algorithm

JOURNAL ARTICLE published December 1996 in SIAM Journal on Computing

Authors: Joseph Cheriyan | Torben Hagerup | Kurt Mehlhorn