1

Depth-First Search and Linear Graph Algorithms

Year:
1972
Language:
english
File:
PDF, 1.47 MB
english, 1972
2

Algorithm 447: efficient algorithms for graph manipulation

Year:
1973
Language:
english
File:
PDF, 719 KB
english, 1973
4

Making data structures persistent

Year:
1989
Language:
english
File:
PDF, 2.58 MB
english, 1989
5

Finding Minimum Spanning Trees

Year:
1976
Language:
english
File:
PDF, 2.04 MB
english, 1976
6

Amortized Computational Complexity

Year:
1985
Language:
english
File:
PDF, 1.57 MB
english, 1985
7

Enumeration of the Elementary Circuits of a Directed Graph

Year:
1973
Language:
english
File:
PDF, 626 KB
english, 1973
8

Time bounds for selection

Year:
1973
Language:
english
File:
PDF, 957 KB
english, 1973
9

Fibonacci heaps and their uses in improved network optimization algorithms

Year:
1987
Language:
english
File:
PDF, 1.45 MB
english, 1987
12

Storing a sparse table

Year:
1979
Language:
english
File:
PDF, 3.68 MB
english, 1979
13

Self-adjusting binary search trees

Year:
1985
Language:
english
File:
PDF, 2.34 MB
english, 1985
14

A Separator Theorem for Planar Graphs

Year:
1979
Language:
english
File:
PDF, 1.51 MB
english, 1979
16

A Separator Theorem for Planar Graphs

Year:
1979
Language:
english
File:
PDF, 1.11 MB
english, 1979
17

A Unified Approach to Path Problems

Year:
1981
Language:
english
File:
PDF, 1.01 MB
english, 1981
18

Triangulating a simple polygon

Year:
1978
Language:
english
File:
PDF, 699 KB
english, 1978
19

The Recognition of Series Parallel Digraphs

Year:
1982
Language:
english
File:
PDF, 1.76 MB
english, 1982
20

Variations on the Common Subexpression Problem

Year:
1980
Language:
english
File:
PDF, 946 KB
english, 1980
21

Efficient maximum flow algorithms

Year:
2014
Language:
english
File:
PDF, 6.62 MB
english, 2014
24

Data Structures and Network Algorithms || 3. Heaps

Year:
1983
Language:
english
File:
PDF, 419 KB
english, 1983
25

A new approach to the maximum-flow problem

Year:
1988
Language:
english
File:
PDF, 1.55 MB
english, 1988
26

The pairing heap: A new form of self-adjusting heap

Year:
1986
Language:
english
File:
PDF, 783 KB
english, 1986
27

Finding minimum-cost circulations by canceling negative cycles

Year:
1989
Language:
english
File:
PDF, 1.18 MB
english, 1989
28

Generalized Nested Dissection

Year:
1979
Language:
english
File:
PDF, 1.53 MB
english, 1979
31

Efficient Planarity Testing

Year:
1974
Language:
english
File:
PDF, 1.26 MB
english, 1974
34

Unique Maximum Matching Algorithms

Year:
2001
Language:
english
File:
PDF, 158 KB
english, 2001
36

Amortized efficiency of list update and paging rules

Year:
1985
Language:
english
File:
PDF, 791 KB
english, 1985
37

Sparse Matrix Computations || GRAPH THEORY AND GAUSSIAN ELIMINATION

Year:
1976
Language:
english
File:
PDF, 1.03 MB
english, 1976
38

Finding Minimum-Cost Circulations by Successive Approximation

Year:
1990
Language:
english
File:
PDF, 2.28 MB
english, 1990
40

Algorithmic Aspects of Vertex Elimination on Directed Graphs

Year:
1978
Language:
english
File:
PDF, 1.95 MB
english, 1978
42

A V2 algorithm for determining isomorphism of planar graphs

Year:
1971
Language:
english
File:
PDF, 512 KB
english, 1971
43

Design and Analysis of a Data Structure for Representing Sorted Lists

Year:
1980
Language:
english
File:
PDF, 2.19 MB
english, 1980
44

Worst-case Analysis of Set Union Algorithms

Year:
1984
Language:
english
File:
PDF, 1.55 MB
english, 1984
45

Planar Point Location Using Persistent Search Trees

Year:
1989
Language:
english
File:
PDF, 592 KB
english, 1989
46

A randomized linear-time algorithm to find minimum spanning trees

Year:
1995
Language:
english
File:
PDF, 619 KB
english, 1995
47

Planar point location using persistent search trees

Year:
1986
Language:
english
File:
PDF, 6.25 MB
english, 1986
49

Sorting Using Networks of Queues and Stacks

Year:
1972
Language:
english
File:
PDF, 316 KB
english, 1972