{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T02:29:45Z","timestamp":1702434585313},"reference-count":8,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1989]]},"DOI":"10.1051\/ita\/1989230302511","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:07:02Z","timestamp":1486048022000},"page":"251-279","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for weighted graph problems on the modified cellular graph automaton"],"prefix":"10.1051","volume":"23","author":[{"given":"S.","family":"Venkatasubramanian","sequence":"first","affiliation":[]},{"given":"Kamala","family":"Krithivasan","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. SMITH A. R., Cellular Automata and Formal Languages, in Proceedings, l l t h SWAT, Vol. III, 1970, pp. 216-224.","DOI":"10.1109\/SWAT.1970.4"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. ROSENTIEHL P., FIKSEL J. R. and HOLLIGER A., 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.3541980265.94030","DOI":"10.1016\/B978-1-4832-3187-7.50019-2"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. WU A. and ROSENFELD A., Cellular Graph Automata I, Information and Control, Vol. 42, 1979, pp. 305-329.0424.68029546343","DOI":"10.1016\/S0019-9958(79)90288-2"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. WU A. and ROSENFELD A., Cellular Graph Automata II, Information and Control, Vol. 42, 1979, pp. 330-353.5463440424.68030","DOI":"10.1016\/S0019-9958(79)90296-1"},{"key":"R5","unstructured":"5. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., Design and Analysis of Computer Algorithms, Addison Wesley, 1974.4135920326.68005"},{"key":"R6","unstructured":"6. DEO N., Graph Theory with Applications to Engineering and Computer Sciences, Prentice Hall, 1974.3603220285.05102"},{"key":"R7","unstructured":"7. ROSENFELD A. et al., Sequential and Cellular Graph Automata, Journal of Information Sciences, 1980.0456.68055"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. MYLOPOULOS J., On the relation of Graph Grammars and Graph Automata, in Proceedings, 13th SWAT, 1972, pp. 108-120.","DOI":"10.1109\/SWAT.1972.15"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230302511\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:58:41Z","timestamp":1568786321000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230302511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":8,"journal-issue":{"issue":"3"},"alternative-id":["ita1989230302511"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1989230302511","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}