{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:17:28Z","timestamp":1763619448671},"reference-count":49,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0012-365x(87)90006-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"157-182","source":"Crossref","is-referenced-by-count":26,"title":["On some complexity properties of N-free posets and posets with bounded decomposition diameter"],"prefix":"10.1016","volume":"63","author":[{"given":"M.","family":"Habib","sequence":"first","affiliation":[]},{"given":"R.H.","family":"M\u00f6hring","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90006-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0012-365X(87)90006-9_BIB2","author":"Bern","year":"1985","journal-title":"Linear time computation of optimal subgraphs of decomposable graphs"},{"key":"10.1016\/0012-365X(87)90006-9_BIB3","volume":"CS-77-04","author":"Booth","year":"1979"},{"key":"10.1016\/0012-365X(87)90006-9_BIB4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0012-365X(87)90006-9_BIB5","first-page":"267","article-title":"Some results about the jump number of an acircuit digraph","author":"Chaty","year":"1974","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","article-title":"The jump number of dags and posets: an introduction","volume":"9","author":"Chein","year":"1980","journal-title":"Ann. Discrete Math."},{"issue":"No. 1","key":"10.1016\/0012-365X(87)90006-9_BIB7","first-page":"3","article-title":"Nombre de sauts et graphes s\u00e9rie-parall\u00e9les","volume":"Vol 13","author":"Cogis","year":"1979","journal-title":"R.A.I.R.O. Informatique Th\u00e9orique\u29f8Theorical Informatics"},{"key":"10.1016\/0012-365X(87)90006-9_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Analysis Appl."},{"key":"10.1016\/0012-365X(87)90006-9_BIB10","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","article-title":"Partially ordered sets","volume":"63","author":"Dushnik","year":"1941","journal-title":"Amer. J. Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB11","series-title":"Lecture Notes in Mathematical Systems","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-642-45567-4_23","article-title":"A construction for strongly greedy ordered sets","volume":"Vol. 226","author":"Faigle","year":"1984"},{"key":"10.1016\/0012-365X(87)90006-9_BIB12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/0604016","article-title":"Minimizing setups for ordered sets: a linear algebraic approach","volume":"4","author":"Gierz","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(87)90006-9_BIB13","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."},{"key":"10.1016\/0012-365X(87)90006-9_BIB14","article-title":"Substitutions des structures combinatories: th\u00e9orie et algothmes","author":"Habib","year":"1981","journal-title":"Th\u00e9se Science Universit\u00e9 P. et M. Curie"},{"key":"10.1016\/0012-365X(87)90006-9_BIB15","first-page":"371","article-title":"Comparability invariants","volume":"23","author":"Habib","year":"1984","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"10.1016\/0012-365X(87)90006-9_BIB16","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":"12","author":"Habib","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(79)90043-X","article-title":"On the X-join decomposition for undirected graphs","volume":"1","author":"Habib","year":"1979","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB18","series-title":"Selected Topics in Graph Theory","first-page":"271","article-title":"Line graphs and line diagraphs","author":"Hemminger","year":"1978"},{"key":"10.1016\/0012-365X(87)90006-9_BIB19","first-page":"743","article-title":"Sur une certaine correspondance entre graphes","volume":"33","author":"Heuchenne","year":"1964","journal-title":"Bull. Soc. Roy. Sci. Li\u00e9ge"},{"key":"10.1016\/0012-365X(87)90006-9_BIB20","series-title":"Complexity of Computer Computations","first-page":"131","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/0012-365X(87)90006-9_BIB21","series-title":"Ordered Sets","first-page":"171","article-title":"Dimension theory for ordered sets","author":"Kelly","year":"1982"},{"key":"10.1016\/0012-365X(87)90006-9_BIB22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(87)90006-9_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(74)90001-5","article-title":"A structured program to generate all topological sorting arrangements","volume":"2","author":"Knuth","year":"1974","journal-title":"Inform. Proc. Letters"},{"key":"10.1016\/0012-365X(87)90006-9_BIB24","first-page":"3","article-title":"Graphical algorithms and their complexity","volume":"81","author":"Lawler","year":"1976","journal-title":"Math. Centre Tracts"},{"key":"10.1016\/0012-365X(87)90006-9_BIB25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to procedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB26","series-title":"Deterministic and Stochastic Scheduling","first-page":"35","article-title":"Recent developments in deterministic and stochastic scheduling","author":"Lawler","year":"1982"},{"key":"10.1016\/0012-365X(87)90006-9_BIB27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","article-title":"Orders CAC","author":"Leclerc","year":"1973","journal-title":"Fund. Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB28","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0012-365X(84)90035-9","article-title":"Almost all comparability graphs are UPO","volume":"50","author":"M\u00f6hring","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB29","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/0012-365X(87)90006-9_BIB30","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB31","first-page":"405","article-title":"Generalized results on the polynomiality of certain weighted sum scheduling problems","volume":"49","author":"M\u00f6hring","year":"1985","journal-title":"Methods Oper. Res."},{"key":"10.1016\/0012-365X(87)90006-9_BIB32","author":"Monma","year":"1984","journal-title":"Optimal sequencing via modular decomposition of sequencing functions"},{"key":"10.1016\/0012-365X(87)90006-9_BIB33","series-title":"Technical Report GIT-ICS-84\/11","article-title":"On-line modular decomposition","author":"Muller","year":"1984"},{"key":"10.1016\/0012-365X(87)90006-9_BIB34","unstructured":"W.H. Pulleyblank, On minimizing setups in precedence constrained scheduling problems, Discrete Appl. Math., to appear."},{"issue":"No 4","key":"10.1016\/0012-365X(87)90006-9_BIB35","first-page":"509","article-title":"Optimal linear extensions by interchanging chains","volume":"Vol. 85","author":"Rival","year":"1982","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(87)90006-9_BIB36","first-page":"355","article-title":"Linear extensions of finite ordered sets","volume":"23","author":"Rival","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(87)90006-9_BIB37","article-title":"Constructing N-free","author":"Rival","year":"1985","journal-title":"jump-critical ordered sets"},{"key":"10.1016\/0012-365X(87)90006-9_BIB38","series-title":"Graphs and Order","first-page":"524","article-title":"Problem Session 1: On Enumeration","author":"Saks","year":"1985"},{"key":"10.1016\/0012-365X(87)90006-9_BIB39","article-title":"Untersuchungen zur Komplexit\u00e4t des Graphenisomorphie-Problems mit Hilfe von Graph-Grammatiken","author":"Schnitzler","year":"1982","journal-title":"Thesis RWTH Aachen"},{"key":"10.1016\/0012-365X(87)90006-9_BIB40","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1287\/opre.23.2.283","article-title":"Decomposition algorithms for single-machine sequencing with precedence relations and defferal cost","volume":"23","author":"Sidney","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0012-365X(87)90006-9_BIB41","series-title":"Working paper 85-9","article-title":"Optimal sequencing by modular decomposition: polynomial algorithms","author":"Sidney","year":"1985"},{"key":"10.1016\/0012-365X(87)90006-9_BIB42","series-title":"Report No 213","article-title":"On a decomposition algorithm for sequencing problems with precedence constraints","author":"Steiner","year":"1983"},{"key":"10.1016\/0012-365X(87)90006-9_BIB43","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0020-0190(82)90080-1","article-title":"A labelling algorithm to recognize a line digraph and output its root digraph","volume":"15","author":"Syslo","year":"1982","journal-title":"Inform. Proc. Letters"},{"key":"10.1016\/0012-365X(87)90006-9_BIB44","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","article-title":"Minimizing the jump number for ordered sets: a graph theoretic approach","author":"Syslo","year":"1984","journal-title":"Order 1"},{"key":"10.1016\/0012-365X(87)90006-9_BIB45","series-title":"Graphs and Order","first-page":"185","article-title":"A graph theoretic approach to the jump number problem","author":"Syslo","year":"1985"},{"issue":"No 3","key":"10.1016\/0012-365X(87)90006-9_BIB46","first-page":"623","volume":"JACM Vol. 29","author":"Takamizawa","year":"1982","journal-title":"Linear-time computability of combinatorial problems on series-parallel graphs"},{"key":"10.1016\/0012-365X(87)90006-9_BIB47","series-title":"Technical report STAN-CS-78-682","article-title":"Parsing flowcharts and series-parallel graphs","author":"Valdes","year":"1978"},{"key":"10.1016\/0012-365X(87)90006-9_BIB48","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"},{"issue":"No 3","key":"10.1016\/0012-365X(87)90006-9_BIB49","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"Vol. 3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic and Discrete Methods"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900069?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87900069?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:27:58Z","timestamp":1555154878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87900069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":49,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0012365X87900069"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90006-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}