{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:15:43Z","timestamp":1733548543167,"version":"3.30.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00236-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:46:25Z","timestamp":1027651585000},"page":"299-318","source":"Crossref","is-referenced-by-count":2,"title":["A selected tour of the theory of identification matrices"],"prefix":"10.1016","volume":"240","author":[{"given":"Lin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00236-4_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01190897","article-title":"Efficient parallel recognition of some circular arc graphs, I","volume":"9","author":"Chen","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB3","doi-asserted-by":"crossref","unstructured":"L. Chen, Parallel graph isomorphism detection with identification matrices, in: S. Horiguchi, D.F. Hsu, M. Kimura (Eds.), Proc. Int. Symp. on Parallel Architectures, Algorithms and Networks, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 105\u2013112.","DOI":"10.1109\/ISPAN.1994.367158"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB4","unstructured":"L. Chen, Sequential graph isomorphism detection with identification matrices, in: S. Bai, J. Fan, X. Li (Eds.), Proc. Int. Conf. for Young Computer Scientists, Peking University Press, 1995, Peking, pp. 630\u2013635."},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB5","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/71.491584","article-title":"Graph isomorphism and identification matrices: parallel algorithms","volume":"7","author":"Chen","year":"1996","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB6","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BF02523192","article-title":"Efficient parallel recognition of some circular arc graphs, II","volume":"17","author":"Chen","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB7","first-page":"222","article-title":"A selected tour of the theory of identification matrices","volume":"Vol. 1276","author":"Chen","year":"1997"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB8","doi-asserted-by":"crossref","unstructured":"L. Chen, A provably fastest parallel algorithm for the recognition of the consecutive ones property with selected applications, in: Proc. Int. Conf. on Parallel and Distributed Systems, IEEE, Computer Society, Alamitos, CA, 1997, pp. 594\u2013601.","DOI":"10.1109\/ICPADS.1997.652604"},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0196-6774(91)90010-V","article-title":"Parallel recognition of the consecutive ones property with applications","volume":"12","author":"Chen","year":"1991","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(99)00236-4_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230230105","article-title":"Efficient parallel algorithms for bipartite permutation graphs","volume":"23","author":"Chen","year":"1993","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S0304-3975(99)00236-4_BIB11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0210015","article-title":"Linear time automorphism algorithms for trees, interval graphs, and planar graphs","volume":"10","author":"Colbourn","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00236-4_BIB12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(99)00236-4_BIB13","series-title":"Data Base File Organization","first-page":"151","article-title":"Implementation of a linear time isomorphism test for interval graphs","author":"Diamond","year":"1983"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0304-3975(99)00236-4_BIB15"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB16","doi-asserted-by":"crossref","unstructured":"W.-L. Hsu, A simple test for the consecutive ones property, in: T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki, M. Yamashita (Eds.), Proc. Ann. Int. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 650, Springer, Berlin, 1992, 459\u2013468.","DOI":"10.1007\/3-540-56279-6_98"},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539793260726","article-title":"O(mn) algorithms for the recognition and isomorphism problems on circular-arc graphs","volume":"24","author":"Hsu","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00236-4_BIB18","series-title":"Complexity Computer Comput.","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB19","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(99)00236-4_BIB20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","article-title":"A linear time algorithm for deciding interval graph isomorphism","volume":"26","author":"Lueker","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00236-4_BIB21","unstructured":"F.S. Roberts, Representations of indifference relations, Ph.D. Thesis, Stanford University, 1968."},{"issue":"3","key":"10.1016\/S0304-3975(99)00236-4_BIB22","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jcss.1995.1078","article-title":"On the all-pairs-shortest-path problem in unweighted undirected graphs","volume":"51","author":"Seidel","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0304-3975(99)00236-4_BIB23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(92)90200-F","article-title":"A new upper bound on the complexity of the all pairs shortest path problem","volume":"43","author":"Takaoka","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(99)00236-4_BIB24","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","article-title":"Matrix characterization of circular-arc graphs","volume":"39","author":"Tucker","year":"1971","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(99)00236-4_BIB25","unstructured":"T. Wu, An O(n3) Isomorphism test for circular-arc graphs, Ph.D. Thesis, SUNY Stony Brook, 1983."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T17:12:17Z","timestamp":1733505137000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002364"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00236-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}