An efficient algorithm for minimum feedback vertex sets in rotator graphs
DOI10.1016/J.IPL.2009.01.004zbMATH Open1209.68378OpenAlexW1992661305MaRDI QIDQ987789FDOQ987789
Authors: Chi-Jung Kuo, Chiun-Chieh Hsu, Hon-Ren Lin, Kung-Kuei Lin 
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.004
Recommendations
- Feedback Vertex Sets in Rotator Graphs
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Minimal feedback vertex sets in directed split‐stars
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Node-Deletion Problems on Bipartite Graphs
- Feedback vertex sets in star graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- Feedback vertex set in hypercubes
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Minimum feedback vertex sets in shuffle-based interconnection networks
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Feedback Vertex Sets in Rotator Graphs
- A Graph Theoretic Approach to Statistical Data Security
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
Cited In (6)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS
- Feedback vertex sets on restricted bipartite graphs
- Feedback Vertex Sets in Rotator Graphs
- Domination number and feedback vertex number of complements of line graphs
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- Two Hardness Results on Feedback Vertex Sets
This page was built for publication: An efficient algorithm for minimum feedback vertex sets in rotator graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987789)
