{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T06:01:37Z","timestamp":1698645697439},"reference-count":28,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5356,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1002\/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-a","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:09:17Z","timestamp":1031706557000},"page":"84-93","source":"Crossref","is-referenced-by-count":9,"title":["Embedding longest fault-free paths in arrangement graphs with faulty vertices"],"prefix":"10.1002","volume":"37","author":[{"given":"Ray-Shang","family":"Lo","sequence":"first","affiliation":[]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2001]]},"reference":[{"key":"BIB1","first-page":"393","author":"Akers","year":"1986","journal-title":"Proc Int Conf Parallel Processing"},{"key":"BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","author":"Akers","year":"1989","journal-title":"IEEE Trans Comput"},{"key":"BIB3","volume-title":"Parallel computation: Models and methods","author":"Akl","year":"1997","unstructured":"Parallel computation: Models and methods, Prentice-Hall, Englewood Cliffs, NJ, 1997."},{"key":"BIB4","author":"Ascheuer","year":"1995","unstructured":"Hamiltonian path problems in the on-line optimization of exible manufacturing systems, Ph.D. Thesis, University of Technology Berlin, Germany, 1995 (also available at ftp:\/\/ftp.zib.de\/pub\/zib-publications\/reports\/TR-96-03.ps)."},{"key":"BIB5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0743-7315(91)90071-G","volume":"11","author":"Chan","year":"1991","journal-title":"J Parallel Distrib Comput"},{"key":"BIB6","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0404045","volume":"4","author":"Chan","year":"1991","journal-title":"SIAM J Disc Math"},{"key":"BIB7","author":"Day","year":"1991","unstructured":"and Characterization of node disjoint paths in arrangement graphs, Technical Report TR 91-43, Computer Science Department, University of Minnesota, 1991."},{"key":"BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","volume":"42","author":"Day","year":"1992","journal-title":"Info Process Lett"},{"key":"BIB9","author":"Day","year":"1993","unstructured":"and Embedding grids, hypercubes, and trees in arrangement graphs, Proc Int Conf on Parallel Processing, 1993, Vol. III, pp. 65-72."},{"key":"BIB10","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1109\/12.238494","volume":"42","author":"Day","year":"1993","journal-title":"IEEE Trans Comput"},{"key":"BIB11","author":"Fernandes","year":"1994","unstructured":"and Embedding rings in recursive networks, Proc IEEE Symp on Parallel and Distributed Processing, 1994, pp. 273-280."},{"key":"BIB12","author":"Hsieh","year":"1998","unstructured":"and Embed longest rings onto star graphs with vertex faults, Proc Int Conf on Parallel Processing, 1998, pp. 140-147."},{"key":"BIB13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/71.755822","volume":"10","author":"Hsieh","year":"1999","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"BIB14","author":"Hsieh","journal-title":"Networks"},{"key":"BIB15","author":"Hsieh","unstructured":"and Fault-tolerant embedding of longest paths in star graphs with edge faults, submitted for publication."},{"key":"BIB16","author":"Hsieh","unstructured":"and Embed a longest path between arbitrary two vertices of a faulty star graph, submitted for publication."},{"key":"BIB17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0218126691000215","volume":"1","author":"Jwo","year":"1991","journal-title":"J Circuits Syst Comput"},{"key":"BIB18","author":"Latifi","year":"1996","unstructured":"and Hamiltonicity of the clustered-star graph with embedding applications, Proc Int Conf on Parallel and Distributed Processing Techniques and Applications, 1996, pp. 734-744."},{"key":"BIB19","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0020-0255(96)00280-0","volume":"99","author":"Latifi","year":"1997","journal-title":"Info Sci"},{"key":"BIB20","author":"Latifi","year":"1992","unstructured":"and Optimal ring embedding in hypercubes with faulty links, Proc IEEE Symp on Fault-Tolerant Computing, 1992, pp. 178-184."},{"key":"BIB21","volume-title":"Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes","author":"Leighton","year":"1992","unstructured":"Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, Morgan Kaufmann, San Mateo, California, 1992."},{"key":"BIB22","author":"Lo","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"BIB23","author":"Nigam","year":"1990","unstructured":"and Embedding Hamiltonians and hypercubes in star interconnection graphs, Proc Int Conf on Parallel Processing, 1990, Vol. III, pp. 340-343."},{"key":"BIB24","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/12.260637","volume":"42","author":"Rowley","year":"1993","journal-title":"IEEE Trans Comput"},{"key":"BIB25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/12.565593","volume":"46","author":"Rowley","year":"1997","journal-title":"IEEE Trans Comput"},{"key":"BIB26","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(96)00114-7","volume":"59","author":"Tseng","year":"1996","journal-title":"Info Process Lett"},{"key":"BIB27","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1109\/71.640010","volume":"8","author":"Tseng","year":"1997","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"BIB28","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.280808","volume":"43","author":"Yang","year":"1994","journal-title":"IEEE Trans Comput"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-0037(200103)37:2%3C84::AID-NET3%3E3.0.CO;2-A","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-0037(200103)37:2%3C84::AID-NET3%3E3.0.CO;2-A","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T11:06:08Z","timestamp":1625137568000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-0037(200103)37:2<84::AID-NET3>3.0.CO;2-A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-a","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}