{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T20:50:20Z","timestamp":1698353420514},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf01934694","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:46:04Z","timestamp":1122270364000},"page":"54-68","source":"Crossref","is-referenced-by-count":19,"title":["Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search"],"prefix":"10.1007","volume":"28","author":[{"given":"Ling-Ling","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Hsiang","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"BF01934694_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TC.1985.1676563","volume":"C-34","author":"C. C. Shen","year":"1985","unstructured":"C. C. Shen and W. H. Tsai,A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion, IEEE Trans. Computers, Vol. C-34, No. 3, pp. 197\u2013203, Mar. 1985.","journal-title":"IEEE Trans. Computers"},{"issue":"6","key":"BF01934694_CR2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1982.1654050","volume":"15","author":"K. Efe","year":"1982","unstructured":"K. Efe,Heuristic models of task assignment scheduling in distributed systems, Computer, Vol. 15, No. 6, pp. 50\u201356, June 1982.","journal-title":"Computer"},{"issue":"11","key":"BF01934694_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1980.1653419","volume":"13","author":"W. W. Chu","year":"1980","unstructured":"W. W. Chu, L. J. Holloway, M. T. Lan and K. Efe,Task allocation in distributed data processing, Computer, Vol. 13, No. 11, pp. 57\u201369, Nov. 1980.","journal-title":"Computer"},{"issue":"7","key":"BF01934694_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/C-M.1978.218272","volume":"11","author":"H. S. Stone","year":"1978","unstructured":"H. S. Stone and S. H. Bokhari,Control of distributed processes, Computer, Vol. 11, No. 7, pp. 97\u2013106, July 1978.","journal-title":"Computer"},{"issue":"1","key":"BF01934694_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"SE-3","author":"H. S. Stone","year":"1977","unstructured":"H. S. Stone,Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Eng., Vol. SE-3, No. 1, pp. 85\u201393, Jan. 1977.","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"BF01934694_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/TSE.1982.235574","volume":"SE-8","author":"T. C. K. Chow","year":"1982","unstructured":"T. C. K. Chow and J. A. Abraham,Load balancing in distributed systems, IEEE Trans. Software Eng., Vol. SE-8, No. 4, pp. 401\u2013412, July 1982.","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"BF01934694_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","volume":"C-30","author":"S. H. Bokhari","year":"1981","unstructured":"S. H. Bokhari,On the mapping problem, IEEE Trans. Computers, Vol. C-30, No. 3, pp. 207\u2013214, March 1981.","journal-title":"IEEE Trans. Computers"},{"issue":"5","key":"BF01934694_CR8","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TC.1979.1675365","volume":"C-28","author":"Y. C. Chow","year":"1979","unstructured":"Y. C. Chow and W. Kohler,Models for dynamic load balancing in a heterogeneous multiple processor system, IEEE Trans. Computers, Vol. C-28, No. 5, pp. 354\u2013361, May 1979.","journal-title":"IEEE Trans. Computers"},{"key":"BF01934694_CR9","unstructured":"Shyue B. Wu and Ming T. Liu,Assignment of tasks and resources for distributed processing, Proc. Distributed Processing (IEEE COMPCON), pp. 655\u2013662, Washington D.C., Sept., 1980."},{"key":"BF01934694_CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"Danny Dolev","year":"1984","unstructured":"Danny Dolev and M. K. Warmuth,Scheduling precedence graphs of bounded height, Journal of Algorithms, Vol. 5, pp. 48\u201359, 1984.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"BF01934694_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TC.1982.1675884","volume":"C-31","author":"P. R. Ma","year":"1982","unstructured":"P. R. Ma, and E. Y. S. Lee, and M. Tsuchiya,A task allocation model for distributed computing systems, IEEE Trans. Computers, Vol. C-31, No. 1, pp. 41\u201347, Jan. 1982.","journal-title":"IEEE Trans. Computers"},{"issue":"4598","key":"BF01934694_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick,Optimization by simulated annealing, Science, Vol. 220, No. 4598, pp. 671\u2013680, May 1983.","journal-title":"Science"},{"key":"BF01934694_CR13","unstructured":"S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi,Optimization by simulated annealing, IBM Research Report RC9355 (41093), April 1982."},{"key":"BF01934694_CR14","unstructured":"S. M. Jacobs, L. V. Johnson, and O. Khedr,A technique for systems architecture analysis and design applied to the satellite ground systems (SGS), Proc. 4th Int. Conf. Distributed Computing Systems, San Francisco, CA, 14\u201318, May 1984."},{"key":"BF01934694_CR15","unstructured":"M. J. Chung, E. J. Toy, and A. A. Lobo,A parallel computer based on cube connected cycles (an abstract), Proc. Army Research Office Workshop on Future Directions in Computer Architecture and Software, Charleston, SC, 5\u20137, May 1986."},{"key":"BF01934694_CR16","volume-title":"A parallel computer based on cube connected cycles","author":"M. J. Chung","year":"1986","unstructured":"M. J. Chung, et al.,A parallel computer based on cube connected cycles, RPI CIE Report Rensselaer Polytechnic Institutes Center for Integrated Electronics, Troy, NY, Mar. 1986."},{"key":"BF01934694_CR17","unstructured":"W. H. Tsai,Graph matching problems: a survey and a tutorial, Proc. 1st Conf. Computer Algorithms, Hsinchu Taiwan 300, Republic of China, pp. 16.1\u201316.2, July 1982."},{"key":"BF01934694_CR18","volume-title":"Fundamentals of Data Structures","author":"Ellis Horowitz","year":"1982","unstructured":"Ellis Horowitz and Sartaj Sahni,Fundamentals of Data Structures, Computer Science, Woodland and Hills, California, 1982."},{"key":"BF01934694_CR19","volume-title":"Problem Solving Methods in Artificial Intelligence","author":"N. J. Nilsson","year":"1971","unstructured":"N. J. Nilsson,Problem Solving Methods in Artificial Intelligence, McGraw-Hill, New York, 1971."},{"key":"BF01934694_CR20","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. M. Reingold","year":"1977","unstructured":"E. M. Reingold, Jurg Nievergelt, and Narsingh Deo,Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey, 1977."},{"key":"BF01934694_CR21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R. C. Read","year":"1977","unstructured":"R. C. Read and D. G. Corneil,The graph isomorphism disease, J. Graph Theory, Vol. 1, pp. 339\u2013363, 1977.","journal-title":"J. Graph Theory"},{"issue":"3","key":"BF01934694_CR22","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L. Babai","year":"1980","unstructured":"L. Babai, P. Erd\u00f6s, and S. M. Selkow,Random graph isomorphism, SIAM J. Computing, Vol. 9, No. 3, pp. 628\u2013635, Aug. 1980.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"BF01934694_CR23","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TSMC.1983.6313029","volume":"SMC-13","author":"W. H. Tsai","year":"1983","unstructured":"W. H. Tsai and K. S. Fu,Subgraph error-correcting isomorphisms for syntactic pattern recognition, IEEE Trans. Syst., Man, Cybern., Vol. SMC-13, No. 1, pp. 48\u201362, Jan.\/Feb. 1983.","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"BF01934694_CR24","doi-asserted-by":"crossref","unstructured":"R. M. Haralick and J. S. Kartus,Arrangements, homomorphisms, and discrete relaxation, Proc. IEEE Conf. Pattern Recog. and Image Processing, Chicago, IL, U.S.A., May 1978.","DOI":"10.1109\/TSMC.1978.4310036"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934694.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934694\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:10:04Z","timestamp":1557450604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF01934694"],"URL":"https:\/\/doi.org\/10.1007\/bf01934694","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}