{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:53Z","timestamp":1759638953827},"reference-count":11,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4058,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given an undirected graph, The <jats:italic>feedback vertex set<\/jats:italic> problem is to find a set of vertices of minimum cardinality such that removing the vertices in this set makes the graph acyclic. This problem is known to be NP\u2010hard on general graphs. An <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>6<\/jats:sup>) algorithm for this problem on permutation graphs is known. in this paper, we give an <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>4<\/jats:sup>) algorithm for this problem on cocomparability graphs. Our result improves the time complexity of the algorithm and enlarges the class of graphs on which this problem is polynomial time\u2010solvable.<\/jats:p>","DOI":"10.1002\/net.3230260205","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T20:22:01Z","timestamp":1179001321000},"page":"101-111","source":"Crossref","is-referenced-by-count":12,"title":["Feedback vertex set on cocomparability graphs"],"prefix":"10.1002","volume":"26","author":[{"given":"Satyan R.","family":"Coorg","sequence":"first","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028791"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90086-8"},{"key":"e_1_2_1_4_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_5_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90116-R"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90022-3"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(87)80003-3"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"J.Spinrad Transitive orientation inO(n2) time. Proceedings of the 15th Annual ACM Symposium on Theory of Computing. (1983)457\u2013466.","DOI":"10.1145\/800061.808777"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90107-4"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230260205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230260205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T02:48:16Z","timestamp":1698288496000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230260205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["10.1002\/net.3230260205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230260205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}