Suchergebnisse - Tarjan, Robert E.

Network flow algorithms

von Goldberg, Andrew V., Tardos, Éva 1957-, Tarjan, Robert E.

On the efficiency of a good but not linear set union algorithm

von Tarjan, Robert E.

Efficiency of the network simplex algorithm for the maximum flow problem

von Goldberg, Andrew V., Grigoriadis, Michael D., Tarjan, Robert E.

Data structures and network algorithms

von Tarjan, Robert E.

Notes on introductory combinatorics

von Pólya, George 1887-1985, Tarjan, Robert E., Woods, Donald R. 1954-

Notes on introductory combinatorics

von Pólya, George 1887-1985, Tarjan, Robert E., Woods, Donald R. 1954-

Online lesen

Notes on introductory combinatorics

von Pólya, George 1887-1985, Tarjan, Robert E., Woods, Donald R. 1954-

A separator theorem for graphs of bounded genus

von Gilbert, John R., Hutchinson, Joan P., Tarjan, Robert E.

Dividing a graph into triconnected components

von Hopcroft, John E. 1939-, Tarjan, Robert E.

Testing flow graph reducibility

von Tarjan, Robert E.

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

von Tarjan, Robert E

Data structures and network algorithms

von Tarjan, Robert E.

Data structures and network algorithms

von Tarjan, Robert E.

Data structures and network algorithms

von Tarjan, Robert E.

Two linear-time algorithms for five-coloring a planar graph

von Matula, David, Shiloach, Yossi, Tarjan, Robert E.

Recent developments in the complexity of combinatorial algorithms

von Tarjan, Robert E.

Fast algorithms for solving path problems

von Tarjan, Robert E.

Variations of a pebble game of graphs

von Gilbert, John R., Tarjan, Robert E.

Design and analysis of a data structure for representing sorted lists

von Brown, Mark Robbin 1952-, Tarjan, Robert E.

A parallel algorithm for finding a blocking flow in an acyclic network

von Goldberg, Andrew V., Tarjan, Robert E.