{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:17:23Z","timestamp":1648880243226},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00471-7","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T10:54:32Z","timestamp":1058352872000},"page":"523-533","source":"Crossref","is-referenced-by-count":3,"title":["The forbidden minor characterization of line-search antimatroids of rooted digraphs"],"prefix":"10.1016","volume":"131","author":[{"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Masataka","family":"Nakamura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00471-7_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(90)90002-T","article-title":"An algorithmic characterization of antimatroids","volume":"28","author":"Boyd","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF02482912","article-title":"Meet-distributive lattices and anti-exchange closure","volume":"10","author":"Edelman","year":"1980","journal-title":"Algebra Univ."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(90)90048-M","article-title":"Minor characterization of undirected branching greedoids\u2014a short proof","volume":"82","author":"Goecke","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB4","first-page":"14","article-title":"Sur une certain correspondence entre graphes","volume":"33","author":"Heuchenne","year":"1964","journal-title":"Bull. Soc. Roy. Sci. Liege"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB5","series-title":"Convexity and Related Combinatorial Geometry","first-page":"113","article-title":"A perspective on abstract convexity: classifying alignments by varieties","author":"Jamison-Walder","year":"1982"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB6","series-title":"Progress in Combinatorial Optimization, Proceedings of the Silver Jubilee Conference on Combinatorics, Waterloo, June 1982","first-page":"221","article-title":"Greedoids, a structural framework for the greedy algorithm","author":"Korte","year":"1984"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0095-8956(85)90091-7","article-title":"Polymatroid greedoids","volume":"38","author":"Korte","year":"1985","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB8","series-title":"Greedoids","author":"Korte","year":"1991"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB9","unstructured":"M. Nakamura, Algorithmic characterizations of non-simple greedoids and antimatroids, Proceedings of the Fifth Japan\u2013Korea Joint Workshop on Algorithms and Computation, Tokyo, July 2000, pp. 122\u2013129."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB10","unstructured":"M. Nakamura, Excluded-minor characterizations of antimatroids arisen from posets and graph searches, submitted for publication, Discrete Appl. Math., in press."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB11","series-title":"Graph Dynamics","author":"Prisner","year":"1995"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB12","unstructured":"N. Robertson, P.D. Seymour, Graph minors XX: Wagner's conjecture."},{"key":"10.1016\/S0166-218X(02)00471-7_BIB13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0095-8956(88)90067-6","article-title":"A characterization of undirected branching greedoids","volume":"45","author":"Schmidt","year":"1988","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(02)00471-7_BIB14","doi-asserted-by":"crossref","first-page":"28","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:51:35Z","timestamp":1552816295000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004717"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00471-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}