Gabow, Harold: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Path-based depth-first search for strong and biconnected components

Harold N. Gabow

Journal:

Information Processing Letters

Year:

2000

Language:

english

File:

PDF, 110 KB

english, 2000

2

Unique Maximum Matching Algorithms

Harold N Gabow, Haim Kaplan, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

2001

Language:

english

File:

PDF, 158 KB

english, 2001

3

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Galil, Zvi, Micali, Silvio, Gabow, Harold

Journal:

SIAM Journal on Computing

Year:

1986

Language:

english

File:

PDF, 1.34 MB

english, 1986

4

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Gabow, Harold N.

Journal:

Journal of the ACM

Year:

1976

Language:

english

File:

PDF, 828 KB

english, 1976

5

Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Driscoll, James R., Gabow, Harold N., Shrairman, Ruth, Tarjan, Robert E.

Journal:

Communications of the ACM

Year:

1988

Language:

english

File:

PDF, 6.69 MB

english, 1988

6

Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems

Harold N. Gabow, Ying Xu

Journal:

Journal of Computer and System Sciences

Year:

1996

Language:

english

File:

PDF, 754 KB

english, 1996

7

A linear-time algorithm for a special case of disjoint set union

Harold N. Gabow, Robert Endre Tarjan

Journal:

Journal of Computer and System Sciences

Year:

1985

Language:

english

File:

PDF, 931 KB

english, 1985

8

Efficient algorithms for a family of matroid intersection problems

Harold N Gabow, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

1984

Language:

english

File:

PDF, 3.01 MB

english, 1984

9

Decomposing symmetric exchanges in matroid bases

Journal:

Mathematical Programming

Year:

1976

Language:

english

File:

PDF, 253 KB

english, 1976

10

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Harold N. Gabow, Zvi Galil, Thomas Spencer, Robert E. Tarjan

Journal:

Year:

1986

Language:

english

File:

PDF, 939 KB

english, 1986

11

[ACM Press the sixteenth annual ACM symposium - Not Known (1984..-..)] Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84 - Scaling and related techniques for geometry problems

Gabow, Harold N., Bentley, Jon Louis, Tarjan, Robert E.

Year:

1984

Language:

english

File:

PDF, 833 KB

english, 1984

12

Faster Scaling Algorithms for Network Problems

Gabow, Harold N., Tarjan, Robert E.

Journal:

SIAM Journal on Computing

Year:

1989

Language:

english

File:

PDF, 3.36 MB

english, 1989

13

[ACM Press the fifteenth annual ACM symposium - Not Known (1983..-..)] Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 - A linear-time algorithm for a special case of disjoint set union

Gabow, Harold N., Tarjan, Robert Endre

Year:

1983

Language:

english

File:

PDF, 633 KB

english, 1983

14

[IEEE 23rd Annual Symposium on Foundations of Computer Science - Chicago, IL, USA (1982.11.3-1982.11.5)] 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) - Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

Galil, Zvi, Galil, Zvi, Galil, Zvi, Galil, Zvi, Micali, Silvio, Micali, Silvio, Micali, Silvio, Micali, Silvio, Gabow, Harold, Gabow, Harold, Gabow, Harold, Gabow, Harold

Year:

1982

Language:

english

File:

PDF, 841 KB

english, 1982

15

E1688

R. A. Jacobson and Harold Gabow

Journal:

American Mathematical Monthly

Year:

1965

Language:

english

File:

PDF, 281 KB

english, 1965

16

Finding a long directed cycle

Gabow, Harold N., Nie, Shuxin

Journal:

ACM Transactions on Algorithms

Year:

2008

Language:

english

File:

PDF, 262 KB

english, 2008

17

The Weighted Matching Approach to Maximum Cardinality Matching

Gabow, Harold N., Păun, Gheorghe, Rozenberg, Grzegorz, Salomaa, Arto

Journal:

Fundamenta Informaticae

Year:

2017

Language:

english

File:

PDF, 317 KB

english, 2017

18

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson

Journal:

Year:

2009

Language:

english

File:

PDF, 196 KB

english, 2009

19

Algorithms for Graphic Polymatroids and Parametrics-Sets

Journal:

Journal of Algorithms

Year:

1998

Language:

english

File:

PDF, 328 KB

english, 1998

20

Computing Vertex Connectivity: New Bounds from Old Techniques

Monika R. Henzinger, Satish Rao, Harold N. Gabow

Journal:

Journal of Algorithms

Year:

2000

Language:

english

File:

PDF, 198 KB

english, 2000

21

GUEST EDITOR'S FOREWORD

Harold N. Gabow

Journal:

Journal of Computer and System Sciences

Year:

1998

Language:

english

File:

PDF, 73 KB

english, 1998

22

Editor's Foreword

Harold N. Gabow

Journal:

Journal of Computer and System Sciences

Year:

1993

File:

PDF, 28 KB

1993

23

Algorithms for two bottleneck optimization problems

Harold N Gabow, Robert E Tarjan

Journal:

Journal of Algorithms

Year:

1988

Language:

english

File:

PDF, 435 KB

english, 1988

24

Bipartition constrained edge-splitting in directed graphs

Harold N. Gabow, Tibor Jordán

Journal:

Discrete Applied Mathematics

Year:

2001

Language:

english

File:

PDF, 147 KB

english, 2001

25

Parallel tetrahedral mesh adaptation with dynamic load balancing

Leonid Oliker, Rupak Biswas, Harold N Gabow

Journal:

Parallel Computing

Year:

2000

Language:

english

File:

PDF, 481 KB

english, 2000

26

The limits of input-queued switch performance with future packet arrival information

Timothy X. Brown, Harold N. Gabow

Journal:

Computer Networks

Year:

2003

Language:

english

File:

PDF, 301 KB

english, 2003

27

Using euler partitions to edge color bipartite multigraphs

Harold N. Gabow

Journal:

International Journal of Parallel Programming

Year:

1976

Language:

english

File:

PDF, 484 KB

english, 1976

28

Editor's foreword

Harold N. Gabow

Journal:

Year:

1994

Language:

english

File:

PDF, 156 KB

english, 1994

29

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Harold N. Gabow, K. S. Manu

Journal:

Mathematical Programming

Year:

1998

Language:

english

File:

PDF, 1.95 MB

english, 1998

30

An efficient approximation algorithm for the survivable network design problem

Harold N. Gabow, Michel X. Goemans, David P. Williamson

Journal:

Mathematical Programming

Year:

1998

Language:

english

File:

PDF, 1.91 MB

english, 1998

31

Forests, frames, and games: Algorithms for matroid sums and applications

Harold N. Gabow, Herbert H. Westermann

Journal:

Year:

1992

Language:

english

File:

PDF, 2.04 MB

english, 1992

32

An augmenting path algorithm for linear matroid parity

Harold N. Gabow, Matthias Stallmann

Journal:

Year:

1986

Language:

english

File:

PDF, 1.58 MB

english, 1986

33

On the L∞-norm of extreme points for crossing supermodular directed network LPs

Harold N. Gabow

Journal:

Mathematical Programming

Year:

2007

Language:

english

File:

PDF, 450 KB

english, 2007

34

An Algorithm for Strongly Connected Component Analysis innlognSymbolic Steps

Roderick Bloem, Harold N. Gabow, Fabio Somenzi

Journal:

Formal Methods in System Design

Year:

2006

Language:

english

File:

PDF, 344 KB

english, 2006

35

Algorithmic proofs of two relations between connectivity and the 1-factors of a graph

Harold N. Gabow

Journal:

Discrete Mathematics

Year:

1979

Language:

english

File:

PDF, 819 KB

english, 1979

36

Incrementing Bipartite Digraph Edge-Connectivity

Harold N. Gabow, Tibor Jordán

Journal:

Journal of Combinatorial Optimization

Year:

2000

Language:

english

File:

PDF, 276 KB

english, 2000

37

[IEEE 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Portland, OR, USA (1985.10.21-1985.10.23)] 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - A scaling algorithm for weighted matching on general graphs

Gabow, Harold N.

Year:

1985

Language:

english

File:

PDF, 1.65 MB

english, 1985

38

Some improved bounds on the number of 1-factors of n-connected graphs

Harold N. Gabow

Journal:

Information Processing Letters

Year:

1976

Language:

english

File:

PDF, 474 KB

english, 1976

39

A note on degree-constrained star subgraphs of bipartite graphs

Harold N. Gabow

Journal:

Information Processing Letters

Year:

1976

Language:

english

File:

PDF, 666 KB

english, 1976

40

A linear-time recognition algorithm for interval dags

Harold N. Gabow

Journal:

Information Processing Letters

Year:

1981

Language:

english

File:

PDF, 412 KB

english, 1981

41

A linear-time algorithm for finding a minimum spanning pseudoforest

Harold N. Gabow, Robert E. Tarjan

Journal:

Information Processing Letters

Year:

1988

Language:

english

File:

PDF, 460 KB

english, 1988

42

Iterated Rounding Algorithms for the Smallest k -Edge Connected Spanning Subgraph

Gabow, Harold N., Gallagher, Suzanne R.

Journal:

SIAM Journal on Computing

Year:

2012

Language:

english

File:

PDF, 897 KB

english, 2012

43

Two Algorithms for Generating Weighted Spanning Trees in Order

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

1977

Language:

english

File:

PDF, 1.28 MB

english, 1977

44

Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

1988

Language:

english

File:

PDF, 2.20 MB

english, 1988

45

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs

Gabow, Harold N., Kariv, Oded

Journal:

SIAM Journal on Computing

Year:

1982

Language:

english

File:

PDF, 1.48 MB

english, 1982

46

How to Make a Square Grid Framework with Cables Rigid

Gabow, Harold N., Jordán, Tibor

Journal:

SIAM Journal on Computing

Year:

2000

Language:

english

File:

PDF, 320 KB

english, 2000

47

Finding Paths and Cycles of Superpolylogarithmic Length

Gabow, Harold N.

Journal:

SIAM Journal on Computing

Year:

2007

Language:

english

File:

PDF, 288 KB

english, 2007

48

Edge-Connectivity Augmentation with Partition Constraints

Bang-Jensen, JOrgen, Gabow, Harold N., Jordán, Tibor, Szigeti, Zoltán

Journal:

SIAM Journal on Discrete Mathematics

Year:

1999

Language:

english

File:

PDF, 724 KB

english, 1999

49

An Improved Analysis for Approximating the Smallest k -Edge Connected Spanning Subgraph of a Multigraph

Gabow, Harold N.

Journal:

SIAM Journal on Discrete Mathematics

Year:

2005

Language:

english

File:

PDF, 221 KB

english, 2005

50

A combinatoric interpretation of dual variables for weighted matching and -factors

Gabow, Harold N.

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 534 KB

english, 2012

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски