1. Dynamic Programming;Bellman,1957
2. Graphs and Networks;Carré,1979
3. Chen, D., Mao, J., Mohiuddin, K., 1999. An efficient algorithm for matching a lexicon with a segmentation graph. In: Lea, W. (Ed.), Proceedings of the Fifth International Conference on Document Analysis and Recognition, IEEE, pp. 543–546
4. A note on two problems in connection with graphs;Dijkstra;Numer. Math.,1959
5. Downton, A., Du, L., Lucas, S., Badr, A., 1997. Generalized contextual recognition of hand-printed documented using semantic tress with lazy evaluation. In: Proceedings of the Fourth International Conference on Document Analysis and Recognition, IEEE, Ulm, Germany, pp. 238–242