Minimum feedback vertex sets in shuffle-based interconnection networks
From MaRDI portal
(Redirected from Publication:1007599)
Recommendations
Cites work
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Decycling cubes and grids
- Decycling graphs
- Decycling hypercubes
- Feedback vertex set in hypercubes
- Feedback vertex sets and cyclically reducible graphs
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- On the feedback vertex set problem in permutation graphs
Cited in
(12)- The feedback number of crossed cube networks
- An efficient algorithm for minimum feedback vertex sets in rotator graphs
- New upper bounds on feedback vertex numbers in butterflies
- Feedback vertex set in hypercubes
- Feedback vertex sets on restricted bipartite graphs
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- Feedback vertex sets in mesh-based networks
- Structural Information and Communication Complexity
- Feedback numbers of Kautz digraphs
- Feedback numbers of de Bruijn digraphs
- Two Hardness Results on Feedback Vertex Sets
This page was built for publication: Minimum feedback vertex sets in shuffle-based interconnection networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007599)
