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

How to cite

top

Venkatasubramanian, S., Krithivasan, Kamala, and Rangan, C. Pandu. "Algorithms for weighted graph problems on the modified cellular graph automaton." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 23.3 (1989): 251-279. <http://eudml.org/doc/92334>.

@article{Venkatasubramanian1989,
author = {Venkatasubramanian, S., Krithivasan, Kamala, Rangan, C. Pandu},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {cellular graph automaton; weighted graph problems; minimum weight spanning tree; shortest paths},
language = {eng},
number = {3},
pages = {251-279},
publisher = {EDP-Sciences},
title = {Algorithms for weighted graph problems on the modified cellular graph automaton},
url = {http://eudml.org/doc/92334},
volume = {23},
year = {1989},
}

TY - JOUR
AU - Venkatasubramanian, S.
AU - Krithivasan, Kamala
AU - Rangan, C. Pandu
TI - Algorithms for weighted graph problems on the modified cellular graph automaton
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1989
PB - EDP-Sciences
VL - 23
IS - 3
SP - 251
EP - 279
LA - eng
KW - cellular graph automaton; weighted graph problems; minimum weight spanning tree; shortest paths
UR - http://eudml.org/doc/92334
ER -

References

top
  1. 1. A. R. SMITH, Cellular Automata and Formal Languages, in Proceedings, l l t h SWAT, Vol. III, 1970, pp. 216-224. 
  2. 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. 3. A. WU and A. ROSENFELD, Cellular Graph Automata I, Information and Control, Vol. 42, 1979, pp. 305-329. Zbl0424.68029MR546343
  4. 4. A. WU and A. ROSENFELD, Cellular Graph Automata II, Information and Control, Vol. 42, 1979, pp. 330-353. Zbl0424.68030MR546344
  5. 5. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, Design and Analysis of Computer Algorithms, Addison Wesley, 1974. Zbl0326.68005MR413592
  6. 6. N. DEO, Graph Theory with Applications to Engineering and Computer Sciences, Prentice Hall, 1974. Zbl0285.05102MR360322
  7. 7. A. ROSENFELD et al., Sequential and Cellular Graph Automata, Journal of Information Sciences, 1980. Zbl0456.68055
  8. 8. J. MYLOPOULOS, On the relation of Graph Grammars and Graph Automata, in Proceedings, 13th SWAT, 1972, pp. 108-120. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.