Efficient computation of implicit representations of sparse graphs

Edge-Disjoint Spanning Trees of Finite Graphs

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1961 · 793 citations

Graph Minor, Graph Theory, Structural Graph Theory +6

Embedding planar graphs on the grid

Walter Schnyder · Symposium on Discrete Algorithms · 1990 · 574 citations

Geometric Modeling, Geometric Graph Theory, Graph Theory +15

Decomposition of Finite Graphs Into Forests

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1964 · 453 citations

Graph Minor, Network Science, Graph Theory +6

Deterministic coin tossing with applications to optimal parallel list ranking

Richard Cole, Uzi Vishkin · Information and Control · 1986 · 417 citations

Ranking Algorithm, Engineering, Parallel Complexity Theory +10

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

Hiroshi Nagamochi, Toshihide Ibaraki · SIAM Journal on Discrete Mathematics · 1992 · 393 citations

Directed Graph, Engineering, Planar Graph +21