{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:44:24Z","timestamp":1648629864478},"reference-count":13,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270200851","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:02:33Z","timestamp":1486047753000},"page":"85-95","source":"Crossref","is-referenced-by-count":0,"title":["An approach to parallel algorithm design"],"prefix":"10.1051","volume":"27","author":[{"given":"G.","family":"Georgakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Stafylopatis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. AFRATI F., PAPADIMITRIOU Ch. and PAPAGEORGIOU G., Scheduling Dags to Minimize Time and Communication, Aegian Workshop on Computing (AWOC), Corfu, June 1988.1017467"},{"key":"R2","unstructured":"2. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.4135920326.68005"},{"key":"R3","unstructured":"3. AKL S. G., The Design and Analysis of Parallel Algorithms, Prentice-Hall, 1989.0754.68053"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. BIGGS N., Algebraic Graph Theory, Cambridge University Press, 1974.3476490284.05101","DOI":"10.1017\/CBO9780511608704"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. BOPPANA R. B., HASTAD J. and ZACHOS S., Does Co-NP Have Short Interactive Proofs?, Information Processing Letters, Vol. 25, 1987, pp. 27-32.8961550653.68037","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"R6","unstructured":"6. COFFMAN E. G. and DENNING P. J., Operating Systems Theory, Prentice-Hall, 1973."},{"key":"R7","unstructured":"7. E. G. COFFMAN (Editor), Computer and Job-shop Scheduling Theory, John Wiley, 1976.6296910359.90031"},{"key":"R8","unstructured":"8. GAREY M. R. and JOHNSON D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979.5190660411.68039"},{"key":"R9","unstructured":"9. GOYAL D. K., Scheduling Processor Bound Systems, Report No CS-76-036, Washington State University, 1976."},{"key":"R10","unstructured":"10. HARARY F., Graph Theory, Addison-Wesley, 1972.2569110182.57702"},{"key":"R11","unstructured":"11. KARP R. M., A Survey of Parallel Algorithms for Shared-Memory Machines, Report No. UCB\/CSD 88\/408, University of California Berkeley, March 1988."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. LUKS M. E., Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and System Sciences, Vol. 25, 1982, pp. 42-65.6853600493.68064","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. SABIDUSSI G., Vertex Transitive Graphs, Monatshefte f\u00fcr Mathematik, 68, 1964, pp. 426-438.1772671758150136.44608","DOI":"10.1007\/BF01304186"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270200851\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:57:46Z","timestamp":1568786266000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270200851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":13,"journal-issue":{"issue":"2"},"alternative-id":["ita1993270200851"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270200851","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}