{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:15:31Z","timestamp":1648772131015},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0304-3975(96)00210-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"393-406","source":"Crossref","is-referenced-by-count":2,"title":["Parallel N-free order recognition"],"prefix":"10.1016","volume":"175","author":[{"given":"Laurent","family":"Viennot","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00210-1_BIB1","series-title":"Spring Joint Computer Conf.","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB2_1","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(95)80025-5","article-title":"Parallel interval order recognition and construction of interval representation","author":"Bender","year":"1993"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB2_2","unstructured":"Theoret. Comput. Sci. to appear."},{"issue":"4","key":"10.1016\/S0304-3975(96)00210-1_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB5","series-title":"Proc. 22nd Ann. Symp. on Theory of Computing","first-page":"193","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB6","series-title":"Activity Networks","author":"Elmaghraby","year":"1977"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB7","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1137\/0214068","article-title":"Algorithmic approaches to setup minimization","volume":"14","author":"Faigle","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(96)00210-1_BIB8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(81)90069-7","article-title":"A linear time recognition algorithm for interval dags","volume":"12","author":"Gabow","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1985"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","article-title":"Maximal chains and antichains","volume":"65","author":"Grillet","year":"1969","journal-title":"Fund. Math."},{"issue":"3","key":"10.1016\/S0304-3975(96)00210-1_BIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","article-title":"N-free poses as generalizations of series-parallel posets","volume":"12","author":"Habib","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02854581","article-title":"Some properties of line digraphs","volume":"9","author":"Harary","year":"1960","journal-title":"Rend. Circ. Math. Palermo"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB13","series-title":"Selected Topics in Graph Theory","first-page":"271","article-title":"Line graphs and line digraphs","author":"Hemminger","year":"1978"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","article-title":"Orders \u201cc.a.c.\u201d","volume":"79","author":"Leclerc","year":"1973","journal-title":"Fund. Math."},{"issue":"2","key":"10.1016\/S0304-3975(96)00210-1_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00383402","article-title":"Transitive closure for restricted classes of partial orders","volume":"8","author":"Ma","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB16","series-title":"Proc. Allerton Conf. on Computing, Communication and Control","first-page":"603","article-title":"Sorting in constant number of row and column phases on a mesh","author":"Marberg","year":"1987"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB17","series-title":"Project Management with CPM and PERT","author":"Moder","year":"1964"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB18","series-title":"Algorithms and Order","first-page":"105","article-title":"Computationally tractable classes of ordered sets","author":"Mohring","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(96)00210-1_BIB19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in simd computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval-ordered tasks","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB21","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pneuili","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB22","first-page":"387","article-title":"Optimal linear extensions by interchanging chains","volume":"89","author":"Rival","year":"1982"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB23","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB24","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.3230160308","article-title":"The minimum dummy task problem","volume":"16","author":"Spinrad","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(82)90080-1","article-title":"A labeling algorithm to recognize a line digraph and output its root graph","volume":"15","author":"Syslo","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00210-1_BIB26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230140104","article-title":"On the computational complexity of the minimum-dummy-activities problem in a pert network","volume":"14","author":"Syslo","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB27","series-title":"Graphs and Order","first-page":"185","article-title":"A graph theoretic approach to the jump number problem","author":"Syslo","year":"1985"},{"key":"10.1016\/S0304-3975(96)00210-1_BIB28","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T12:49:41Z","timestamp":1578487781000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0304397596002101"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00210-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}