{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:22:23Z","timestamp":1665462143113},"reference-count":24,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p> A feedback vertex\/arc set (abbreviated as FVS\/FAS) of a graph is a subset of the vertices\/arcs which contains at least one vertex\/arc for every cycle of that graph. A minimum FVS\/FAS is an FVS\/FAS which contains the smallest number of vertices\/arcs. Hsu et al. [11] first proposed an algorithm which can find a minimum FVS in a rotator graph. In this paper, we present a formula for finding an FAS for a rotator graph and prove that the FAS is minimum. This formula can be easily implemented by an efficient algorithm which obtains a minimum FAS in a rotator graph. Finally, we also present a concise formula for finding a minimum FAS in an incomplete rotator graph in this paper. <\/jats:p>","DOI":"10.1142\/s0129054112500116","type":"journal-article","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T05:47:17Z","timestamp":1341294437000},"page":"931-940","source":"Crossref","is-referenced-by-count":1,"title":["MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS"],"prefix":"10.1142","volume":"23","author":[{"given":"CHI-JUNG","family":"KUO","sequence":"first","affiliation":[{"name":"Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHIUN-CHIEH","family":"HSU","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HON-REN","family":"LIN","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taipei College of Business, Taipei, Taiwan, ROC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DA-REN","family":"CHEN","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Taichung University of Science and Technology, Taichung, Taiwan, ROC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,7,3]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196305124"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00266-1"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007887"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/71.159045"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90079-O"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009191"},{"key":"rf7","doi-asserted-by":"crossref","unstructured":"P.\u00a0Festa, P. M.\u00a0Pardalos and M. G. C.\u00a0Resende, Handbook of Combinatorial Optimization, The feedback arc set problem\u00a0Supplement volume A (Kluwer Academic Publishers, Boston, MA, 1999)\u00a0pp. 239\u2013244.","DOI":"10.1007\/978-1-4757-3023-4_4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200102"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00127-7"},{"key":"rf10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/11751649_17"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/12.4611"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00504-5"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.01.004"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1109\/71.262593"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00039-8"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90022-3"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011315014322"},{"key":"rf22","volume-title":"Operating Systems Concepts","author":"Silberschatz A.","year":"2003"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.5.1269"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1002\/net.20067"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.11.001"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.047"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054112500116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:04:39Z","timestamp":1565186679000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054112500116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":24,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,7,3]]},"published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1142\/S0129054112500116"],"URL":"https:\/\/doi.org\/10.1142\/s0129054112500116","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}