Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms

Introduction to Algorithms

V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 16.9K citations

Fibonacci heaps and their uses in improved network optimization algorithms

Michael L. Fredman, Robert E. Tarjan · Journal of the ACM · 1987 · 2.6K citations · Full text

Cluster Computing, Binomial Queues, Engineering +23

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Hans L. Bodlaender · SIAM Journal on Computing · 1996 · 1.5K citations

Mathematical Programming, Engineering, Planar Graph +17

Graph minors. II. Algorithmic aspects of tree-width

Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations

Mathematical Programming, Graph Minor, Engineering +8

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 864 citations

Mathematical Programming, Engineering, Graph Theory +7