{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:44:35Z","timestamp":1751877875311},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)00085-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"191-215","source":"Crossref","is-referenced-by-count":7,"title":["A fast parallel algorithm to recognize P4-sparse graphs"],"prefix":"10.1016","volume":"81","author":[{"given":"Rong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Olariu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00085-1_bib1","first-page":"395","article-title":"Directed path graph isomorphism","volume":"vol. 903","author":"Babel","year":"1995"},{"key":"10.1016\/S0166-218X(97)00085-1_bib2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(97)00085-1_bib3","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":"Booth","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(97)00085-1_bib4","first-page":"237","article-title":"Families of recursively defined perfect graphs","volume":"39","author":"Corneil","year":"1983"},{"key":"10.1016\/S0166-218X(97)00085-1_bib5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Burlingham Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib6","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00085-1_bib7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(93)E0138-O","article-title":"Efficient parallel recognition algorithms for cographs and distance hereditary graphs","volume":"57","author":"Dahlhaus","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib8","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1006\/jagm.1993.1042","article-title":"Parallel algorithms for cograph recognition with applications","volume":"15","author":"He","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(97)00085-1_bib9","series-title":"Proceedings of the 2nd Annual Workshop on Computational Learning Theory","first-page":"146","article-title":"Learning read-once formulas using membership queries","author":"Hellerstein","year":"1989"},{"key":"10.1016\/S0166-218X(97)00085-1_bib10","author":"Hoang","year":"1985"},{"key":"10.1016\/S0166-218X(97)00085-1_bib11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF02253613","article-title":"Hamiltonicity in graphs with fewP4's","volume":"54","author":"Hochsta\u02dbttler","year":"1995","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(97)00085-1_bib12","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1991"},{"key":"10.1016\/S0166-218X(97)00085-1_bib13","series-title":"Proceedings of the 5th Jerusalem Conference on Information Technology","first-page":"402","article-title":"A fast parallel recognition algorithm for P4-reducible graphs","author":"Jamison","year":"1990"},{"key":"10.1016\/S0166-218X(97)00085-1_bib14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","article-title":"P4-reducible graphs, a class of uniquely tree representable graphs","volume":"81","author":"Jamison","year":"1989","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib16","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"Recognizing P4-sparse graphs in linear time","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00085-1_bib17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","article-title":"A linear-time recognition algorithm for P4-reducible graphs","volume":"145","author":"Jamison","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00085-1_bib18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","article-title":"P-components and the homogeneous decomposition of graphs","volume":"8","author":"Jamison","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","article-title":"Optimal algorithms for P4-sparse graphs","volume":"61","author":"Jamison","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00085-1_bib20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(97)00085-1_bib21","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0603025","article-title":"Isomorphism testing in hook-up graphs","volume":"3","author":"Klawe","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(97)00085-1_bib22","first-page":"3","article-title":"Graphical algorithms and their complexity","volume":"81","author":"Lawler","year":"1976","journal-title":"Math. Center Tracts"},{"key":"10.1016\/S0166-218X(97)00085-1_bib23","series-title":"On cliques and kernels, a manuscript","author":"Lerchs","year":"1971"},{"key":"10.1016\/S0166-218X(97)00085-1_bib24","series-title":"On the clique-kernel structure of graphs","author":"Lerchs","year":"1972"},{"key":"10.1016\/S0166-218X(97)00085-1_bib25","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0743-7315(91)90111-L","article-title":"An NC recognition algorithm for cographs","volume":"13","author":"Lin","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00085-1_bib26","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/jpdc.1994.1067","article-title":"An optimal parallel matching algorithm for cographs","volume":"22","author":"Lin","year":"1994","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00085-1_bib27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/76372.76375","article-title":"Multicast tree construction in bus-based networks","volume":"33","author":"McKinley","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(97)00085-1_bib28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(97)00085-1_bib29","article-title":"Cographs, a class of tree representable graphs","author":"Stewart","year":"1978"},{"key":"10.1016\/S0166-218X(97)00085-1_bib30","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1017\/S1446788700029232","article-title":"Dacey graphs","volume":"18","author":"Sumner","year":"1974","journal-title":"J. Australian Math. Soc."},{"key":"10.1016\/S0166-218X(97)00085-1_bib31","year":"1995"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000851?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000851?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:47Z","timestamp":1556131847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97000851"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00085-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}