Algorithms for weighted graph problems on the modified cellular graph automaton
S. Venkatasubramanian; Kamala Krithivasan; C. Pandu Rangan
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1989)
- Volume: 23, Issue: 3, page 251-279
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. A. R. SMITH, Cellular Automata and Formal Languages, in Proceedings, l l t h SWAT, Vol. III, 1970, pp. 216-224.
- 2. P. ROSENTIEHL, J. R. FIKSEL and A. HOLLIGER, Intelligent Graphs: Networks of Finite Automata capable of solving Graph Problems, in Graph Theory and Computing, R. C. READ Ed., 1972, pp. 219-265, Academic Press, New York. Zbl0265.94030MR354198
- 3. A. WU and A. ROSENFELD, Cellular Graph Automata I, Information and Control, Vol. 42, 1979, pp. 305-329. Zbl0424.68029MR546343
- 4. A. WU and A. ROSENFELD, Cellular Graph Automata II, Information and Control, Vol. 42, 1979, pp. 330-353. Zbl0424.68030MR546344
- 5. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, Design and Analysis of Computer Algorithms, Addison Wesley, 1974. Zbl0326.68005MR413592
- 6. N. DEO, Graph Theory with Applications to Engineering and Computer Sciences, Prentice Hall, 1974. Zbl0285.05102MR360322
- 7. A. ROSENFELD et al., Sequential and Cellular Graph Automata, Journal of Information Sciences, 1980. Zbl0456.68055
- 8. J. MYLOPOULOS, On the relation of Graph Grammars and Graph Automata, in Proceedings, 13th SWAT, 1972, pp. 108-120.