Robert E Tarjan | Bookhype

Mar 8, 2018

Cover of An Efficient Parallel Biconnectivity Algorithm (Classic Reprint)

An Efficient Parallel Biconnectivity Algorithm (Classic Reprint)

Sep 8, 2011

Cover of An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

An O(n Log N) Algorithm for the Maximal Planar Subgraph Problem

Sep 3, 2011

Cover of More Efficient Bottom-Up Multipattern Matching in Trees

More Efficient Bottom-Up Multipattern Matching in Trees

Aug 30, 2011

Cover of A Linear Time Algorithm for Finding an Ambitus

A Linear Time Algorithm for Finding an Ambitus

Aug 25, 2011

Cover of Efficient Parallel Biconnectivity Algorithm

Efficient Parallel Biconnectivity Algorithm

Jan 1, 1983

Cover of Notes on Introductory Combinatorics

Notes on Introductory Combinatorics (Progress in Computer Science and Applied Logic, #4) (Modern Birkhauser Classics)