## Describe an algorithm to find the largest common unordered sub-branching of two unordered labeled rooted trees. [Hint: This problem will be much easier after you've seen flows

- Describe an algorithm to find the largest common…
- 2013

- Published 2013

The 1950s were not good years for mathematical research. We had a very interesting gentleman in Washington named Wilson. He was secretary of Defense, and he actually had a pathological fear and hatred of the word ‘research’. I’m not using the term lightly; I’m using it precisely. His face would suffuse, he would turn red, and he would get violent if people used the term ‘research’ in his presence. You can imagine how he felt, then, about the term ‘mathematical’. The RAND Corporation was employed by the Air Force, and the Air Force had Wilson as its boss, essentially. Hence, I felt I had to do something to shield Wilson and the Air Force from the fact that I was really doing mathematics inside the RAND Corporation. What title, what name, could I choose? — Richard Bellman, on the origin of his term ‘dynamic programming’ (1984)

@inproceedings{20135DP,
title={5 Dynamic Programming 5.1 Fibonacci Numbers 5.1.1 Recursive Definitions Are Recursive Algorithms},
author={},
year={2013}
}