{"title":"On Minimum Feedback Vertex Sets in Graphs","authors":"Asahi Takaoka, S. Tayu, S. Ueno","doi":"10.1109/ICNC.2012.81","DOIUrl":"https://doi.org/10.1109/ICNC.2012.81","url":null,"abstract":"For the minimum feedback vertex set problem, we show a linear time algorithm for bipartite permutation graphs, the NP-hardness for grid intersection graphs, and a polynomial time algorithm for graphs with maximum degree at most three.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127396772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}