• Publications
  • Influence
Graph drawing by force‐directed placement
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm. Expand
Tidier Drawings of Trees
It is shown that various algorithms for producing tidy drawings of trees contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings, and a new algorithm is presented with comparable time and storage requirements that produces tidier drawings. Expand
Backtrack programming techniques
It is shown how the use of macros can considerably shorten the computation time in many cases and the general backtrack technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorsial problem. Expand
The Complexity of Pursuit on a Graph
A robber and k cop~ chno~ starting veaices in a graph and move in alternation from vortex to vertex along the edges of the graph; it is shown that the pmblern is EXPTIME-cxnnplete. Expand
On a Greedy Heuristic for Complete Matching
It is shown that the “greedy” heuristic of repeatedly matching the two closest unmatched points can be implemented in worst-case time $O(n^2 \log n)$, a reasonable savings compared to the general minimum weighted matching algorithm which requires time proportional to $n^3 $ to find the minimum cost matching in a weighted graph. Expand
Binary Search Trees of Bounded Balance
A new class of binary search trees, called trees of bounded balance, is introduced. These trees are easy to maintain in their form despite insertions and deletions of nodes, and the search time isExpand
The complexity of drawing trees nicely
There is no obvious “principle of optimality” that can be applied, since globally narrow, aesthetic placements of trees may require wider than necessary subtrees, and the problem is NP-hard. Expand
Efficient generation of the binary reflected gray code and its applications
Algorithms to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code are presented and applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed. Expand
Optimum lopsided binary trees
Almost-optimum algorithms for the lopsided case of unbounded searching are obtained and some extensions to nonconstant costs are briefly sketched. Expand