{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:48:11Z","timestamp":1648712891520},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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":8082,"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":[[1991,6]]},"DOI":"10.1016\/0166-218x(91)90022-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"31-50","source":"Crossref","is-referenced-by-count":0,"title":["Efficient polynomial algorithms for distributive lattices"],"prefix":"10.1016","volume":"32","author":[{"given":"Jean-Paul","family":"Bordat","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90022-O_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0166-218X(91)90022-O_BIB2","article-title":"Ordre et Classification","volume":"2 volumes","author":"Barbut","year":"1970"},{"key":"10.1016\/0166-218X(91)90022-O_BIB3","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0166-218X(91)90022-O_BIB4","series-title":"Proc. NATO Advanced Study Inst.","first-page":"583","article-title":"An introduction to Cohen-Macaulay partially ordered sets","author":"Bjorner","year":"1982"},{"key":"10.1016\/0166-218X(91)90022-O_BIB5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(85)90026-5","article-title":"Parcours dans les graphes: un outil pour l'algorithmique des ensembles ordonn\u00e9s","volume":"3","author":"Bordat","year":"1985","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/0166-218X(91)90022-O_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1051\/ita\/1987210201811","article-title":"Complexit\u00e9 de probl\u00e8mes li\u00e9s aux graphes sans circuit","volume":"21","author":"Bordat","year":"1987","journal-title":"Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0166-218X(91)90022-O_BIB7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00334850","article-title":"Chordal bipartite graphs and crowns","volume":"2","author":"Bouchitte","year":"1985","journal-title":"Order"},{"key":"10.1016\/0166-218X(91)90022-O_BIB8","series-title":"R.R. no. 85-17","article-title":"Depth-first search and linear extensions","author":"Bouchitte","year":"1985"},{"issue":"2","key":"10.1016\/0166-218X(91)90022-O_BIB9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1090\/S0002-9939-1983-0695239-4","article-title":"Graphs orientable as distributive lattices","volume":"88","author":"Duffus","year":"1983","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(91)90022-O_BIB10","first-page":"301","article-title":"A reduct-and-closure algorithm for graphs","volume":"79","author":"Goralcikova","year":"1979"},{"key":"10.1016\/0166-218X(91)90022-O_BIB11","series-title":"General Lattice Theory","author":"Gratzer","year":"1978"},{"key":"10.1016\/0166-218X(91)90022-O_BIB12","series-title":"R.R. no. 83-10","article-title":"Linear equivalences for transitivity in graphs","author":"Habib","year":"1983"},{"key":"10.1016\/0166-218X(91)90022-O_BIB13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(85)90030-7","article-title":"N-free posets as generalizations of series-parallel posets","volume":"3","author":"Habib","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(91)90022-O_BIB14","first-page":"157","article-title":"On some complexity properties of N-free posets and posets with bounded decomposition diameter","volume":"63","author":"Habib","year":"1987"},{"key":"10.1016\/0166-218X(91)90022-O_BIB15","series-title":"Th\u00e8se de 3e cycle","article-title":"Sur quelques applications du parcours en profondeur dans les graphes","author":"Hamroun","year":"1985"},{"key":"10.1016\/0166-218X(91)90022-O_BIB16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/1008328.1008329","article-title":"Big omicron and big omega and big theta","author":"Knuth","year":"1976","journal-title":"Sigact News"},{"key":"10.1016\/0166-218X(91)90022-O_BIB17","first-page":"1339","article-title":"Reconnaissance du caract\u00e8re distributif d'un treillis fini","volume":"282","author":"Lavall\u00e9e","year":"1976","journal-title":"C.R. Acad. Sci. Paris"},{"issue":"3","key":"10.1016\/0166-218X(91)90022-O_BIB18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1051\/ro\/1984180302471","article-title":"Diam\u00e8tre de graphes et qualit\u00e9 de service d'un r\u00e9seau de donn\u00e9es","volume":"18","author":"Lesk","year":"1984","journal-title":"RAIRO V"},{"key":"10.1016\/0166-218X(91)90022-O_BIB19","article-title":"Probl\u00e8mes de transversalit\u00e9 dans les hypergraphes, les ensembles ordonn\u00e9s, et en th\u00e9orie de la d\u00e9cision collective","author":"Monjardet","year":"1974","journal-title":"Doct. Etat"},{"key":"10.1016\/0166-218X(91)90022-O_BIB20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00340774","article-title":"Complexity of diagrams","volume":"3","author":"Nesetril","year":"1987","journal-title":"Order"},{"issue":"2","key":"10.1016\/0166-218X(91)90022-O_BIB21","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0166-218X(91)90022-O_BIB22","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/356044.356048","article-title":"Space-efficient implementations of graph search methods","volume":"9","author":"Tarjan","year":"1983","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0166-218X(91)90022-O_BIB23","first-page":"1","article-title":"The recognition of series-parallel digraphs","author":"Valdes","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190022O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190022O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:20:22Z","timestamp":1555136422000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190022O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["0166218X9190022O"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90022-o","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}