An efficient algorithm for minimum feedback vertex sets in rotator graphs
type: Item
instance of: scholarly article
title: An efficient algorithm for minimum feedback vertex sets in rotator graphs
zbMATH Open document ID: 1209.68378
author: Chi-Jung Kuo
author: Chiun-Chieh Hsu
author: Hon-Ren Lin
author: Kung-Kuei Lin
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5771238
zbMATH Keywords: feedback vertex set
zbMATH Keywords: rotator graph
zbMATH Keywords: generator
zbMATH Keywords: cycle
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.004
OpenAlex ID: W1992661305
cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
cites work: New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
cites work: Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
cites work: Feedback vertex set in hypercubes
cites work: Q4198056
cites work: A Graph Theoretic Approach to Statistical Data Security
cites work: Feedback Vertex Sets in Rotator Graphs
cites work: Approximation algorithms for combinatorial problems
cites work: Minimum feedback vertex sets in shuffle-based interconnection networks
cites work: Almost exact minimum feedback vertex set in meshes and butterflies
cites work: Feedback vertex sets in star graphs
cites work: Node-Deletion Problems on Bipartite Graphs
DOI: 10.1016/J.IPL.2009.01.004
description: scientific article; zbMATH DE number 5771238