UB Paderborn / Katalog / Suche / in CDI

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM, 1987-07, Vol.34 (3), p.596-615

1987

Volltextzugriff (PDF)

Testing graph connectivity

Proceedings of the sixth annual ACM symposium on Theory of computing, 1974, p.185-193

Tarjan, R. Endre

1974

Volltextzugriff (PDF)

A hierarchical clustering algorithm using strong components

Information processing letters, 1982-03, Vol.14 (1), p.26-29

Tarjan, R. Endre

1982

Volltextzugriff (PDF)

Network Flow and Testing Graph Connectivity

SIAM journal on computing, 1975-12, Vol.4 (4), p.507-518

1975

Volltextzugriff (PDF)

A combinatorial problem which is complete in polynomial space

Proceedings of the seventh annual ACM symposium on Theory of computing, 1975, p.66-71

1975

Volltextzugriff (PDF)

The Planar Hamiltonian Circuit Problem is NP-Complete

SIAM journal on computing, 1976-12, Vol.5 (4), p.704-714

1976

Volltextzugriff (PDF)

Algorithmic Aspects of Vertex Elimination on Graphs

SIAM journal on computing, 1976-06, Vol.5 (2), p.266-283

1976

Volltextzugriff (PDF)

A note on finding the bridges of a graph

Information processing letters, 1974, Vol.2 (6), p.160-161

Tarjan, R.Endre

1974

Volltextzugriff (PDF)

Algorithmic aspects of vertex elimination

Proceedings of the seventh annual ACM symposium on Theory of computing, 1975, p.245-254

1975

Volltextzugriff (PDF)

Testing flow graph reducibility

Journal of computer and system sciences, 1974-01, Vol.9 (3), p.355-365

Tarjan, R. Endre

1974

Volltextzugriff (PDF)

Optimal chain partitions of trees

Information processing letters, 1975, Vol.4 (1), p.24-26

1975

Volltextzugriff (PDF)

Augmentation Problems

SIAM journal on computing, 1976-12, Vol.5 (4), p.653-665

1976

Volltextzugriff (PDF)

Notes on Introductory Combinatorics

1st, 2009

Volltextzugriff (PDF)

Notes on Introductory Combinatorics

1, 1983

Volltextzugriff (PDF)

Partial characterization of a new adenovirus lineage discovered in testudinoid turtles

Infection, genetics and evolution, 2013-07, Vol.17, p.106-112

2013

Volltextzugriff (PDF)

Fast Algorithms for Finding Nearest Common Ancestors

SIAM journal on computing, 1984-05, Vol.13 (2), p.338-355

1984

Volltextzugriff (PDF)

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

Journal of computer and system sciences, 1985-01, Vol.30 (2), p.209-221

1985

Volltextzugriff (PDF)

Amortized computational complexity

SIAM journal on algebraic and discrete methods, 1985-04, Vol.6 (2), p.306-318

TARJAN, R. E

1985

Volltextzugriff (PDF)

A data structure for dynamic trees

Journal of computer and system sciences, 1983-01, Vol.26 (3), p.362-391

1983

Volltextzugriff (PDF)

Applications of Path Compression on Balanced Trees

Journal of the ACM, 1979-10, Vol.26 (4), p.690-715

Tarjan, Robert Endre

1979

Volltextzugriff (PDF)

Fast Algorithms for Solving Path Problems

Journal of the ACM, 1981-07, Vol.28 (3), p.594-614

Tarjan, Robert Endre

1981

Volltextzugriff (PDF)

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM, 1975-04, Vol.22 (2), p.215-225

Tarjan, Robert Endre

1975

Volltextzugriff (PDF)

A Unified Approach to Path Problems

Journal of the ACM, 1981-07, Vol.28 (3), p.577-593

Tarjan, Robert Endre

1981

Volltextzugriff (PDF)

A linear-time algorithm for testing the truth of certain quantified boolean formulas

Information processing letters, 1979-03, Vol.8 (3), p.121-123

1979

Volltextzugriff (PDF)

The analysis of a nested dissection algorithm

Numerische Mathematik, 1986-07, Vol.50 (4), p.377-404

1986

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Fibonacci heaps and their uses in improved network optimization algorithms

Testing graph connectivity

A hierarchical clustering algorithm using strong components

Network Flow and Testing Graph Connectivity

A combinatorial problem which is complete in polynomial space

The Planar Hamiltonian Circuit Problem is NP-Complete

Algorithmic Aspects of Vertex Elimination on Graphs

A note on finding the bridges of a graph

Algorithmic aspects of vertex elimination

Testing flow graph reducibility

Optimal chain partitions of trees

Augmentation Problems

Notes on Introductory Combinatorics

Notes on Introductory Combinatorics

Partial characterization of a new adenovirus lineage discovered in testudinoid turtles

Fast Algorithms for Finding Nearest Common Ancestors

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

Amortized computational complexity

A data structure for dynamic trees

Applications of Path Compression on Balanced Trees

Fast Algorithms for Solving Path Problems

Efficiency of a Good But Not Linear Set Union Algorithm

A Unified Approach to Path Problems

A linear-time algorithm for testing the truth of certain quantified boolean formulas

The analysis of a nested dissection algorithm

Suchergebnisse filtern