Graph drawing by force‐directed placement
- Thomas M. J. Fruchterman, E. Reingold
- Computer ScienceSoftware, Practice & Experience
- 1 November 1991
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.
Combinatorial Algorithms: Theory and Practice
- E. Reingold, J. Nievergelt, N. Deo
- Mathematics
- 1977
Tidier Drawings of Trees
- E. Reingold, Jack Tilford
- ArtIEEE Transactions on Software Engineering
- 1 March 1981
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.
Backtrack programming techniques
- J. Bitner, E. Reingold
- Computer ScienceCACM
- 1 November 1975
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.
On a Greedy Heuristic for Complete Matching
- E. Reingold, R. Tarjan
- Economics, Computer ScienceSIAM journal on computing (Print)
- 1 November 1981
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.
Binary search trees of bounded balance
- J. Nievergelt, E. Reingold
- Computer ScienceSIAM journal on computing (Print)
- 1 May 1972
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 is…
The Complexity of Pursuit on a Graph
- Arthur S. Goldstein, E. Reingold
- MathematicsTheoretical Computer Science
- 29 May 1995
Efficient generation of the binary reflected gray code and its applications
- J. Bitner, G. Ehrlich, E. Reingold
- Computer ScienceCACM
- 1 September 1976
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.
The complexity of drawing trees nicely
- K. Supowit, E. Reingold
- Computer ScienceActa Informatica
- 2004
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.
Calendrical calculations
- N. Dershowitz, E. Reingold
- PhysicsSoftware, Practice & Experience
- 1 September 1990
A unified, algorithmic presentation is given for the Gregorian (current civil), ISO, Julian (old civil), Islamic (Moslem), and Hebrew (Jewish) calendars. Easy conversion among these calendars is a…
...
...