Designing Algorithms
Report ID: TR-069-86Author: Tarjan, Robert E.
Date: 1986-12-00
Pages: 31
Download Formats: |PDF|
Abstract:
The quest for efficiency in computational methods yields not only fast algorithms, but also insights into the problems being solved. Such insights can produce problem-solving methods that combine speed with elegance, simplicity, and generality. This theme is illustrated with two examples: an algorithm for testing planarity of graphs, and a self-adjusting form of binary search tree.