{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:56:09Z","timestamp":1648720569360},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p> A circle n-gon is the region between n or fewer non-crossing chords of a circle, no chord connecting the arcs between two other chords; the sides of a circle n-gon are either chords or arcs of the circle. A circle n-gon graph is the intersection graph of a family of circle n-gons in a circle. The family of circle trapezoid graphs is exactly the family of circle 2-gon graphs and the family of circle graphs is exactly the family of circle 1-gon graphs. The family of circle n-gon graphs contains the polygon-circle graphs which have an intersection representation by circle polygons, each polygon with at most n chords. We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle n-gon graph with positive weights, when its intersection model by n-gon-interval-filaments is given. <\/jats:p>","DOI":"10.1142\/s1793830911001243","type":"journal-article","created":{"date-parts":[[2011,10,21]],"date-time":"2011-10-21T08:29:23Z","timestamp":1319185763000},"page":"323-336","source":"Crossref","is-referenced-by-count":2,"title":["MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS"],"prefix":"10.1142","volume":"03","author":[{"given":"FANICA","family":"GAVRIL","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technion, Haifa 32000, Israel"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260205"},{"key":"rf2","doi-asserted-by":"crossref","unstructured":"S.\u00a0Even and A.\u00a0Itai, Theory of Machines and Computations, eds. Z.\u00a0Kohavi and A.\u00a0Paz (Academic Press, New York, 1971)\u00a0pp. 71\u201386.","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00013-3"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/0601025"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.12.003"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00025-9"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.006"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90684-8"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.03.003"},{"key":"rf10","first-page":"299","volume":"163","author":"Kratochvil J.","journal-title":"Discrete Math."},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.10.006"},{"key":"rf12","first-page":"11","volume":"2","author":"Lin Y.-L.","journal-title":"J. Sci. Eng. Tech."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74839-7_23"},{"key":"rf14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An Algorithmic Approach","author":"Pevzner P. A.","year":"2000"},{"key":"rf15","volume-title":"Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems","author":"Roberts F. S.","year":"1976"},{"key":"rf16","first-page":"99","volume":"7","author":"Saha A.","journal-title":"AMO"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90107-4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:12:51Z","timestamp":1565179971000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":18,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,9]]}},"alternative-id":["10.1142\/S1793830911001243"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001243","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}