{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:15:02Z","timestamp":1649074502055},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00355-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"3-7","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of finding a join of maximum weight"],"prefix":"10.1016","volume":"114","author":[{"given":"A.A.","family":"Ageev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00355-3_BIB1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","article-title":"A property of 4-chromatic graphs and some remarks on critical graphs","volume":"17","author":"Dirac","year":"1952","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(00)00355-3_BIB2","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. Anal. Appl."},{"key":"10.1016\/S0166-218X(00)00355-3_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01202790","article-title":"Conservative weightings and ear decompositions of graphs","volume":"13","author":"Frank","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(00)00355-3_BIB4","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00355-3_BIB5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0607043","article-title":"Efficient algorithms for optimization and selection on series\u2013parallel graphs","volume":"7","author":"Hassin","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00355-3_BIB6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0095-8956(90)90062-5","article-title":"Undirected distances and the postman structure of graphs","volume":"49 B","author":"Seb\u00f6","year":"1990","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(00)00355-3_BIB7","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:25:54Z","timestamp":1556223954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003553"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00355-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}