Minimum feedback vertex sets in shuffle-based interconnection networks

Authors:
Rastislav Královič;Peter Ružička
Affiliations:
Department of Computer Science, Comenius University, Bratislava, Slovak Republic;Institute of Informatics, Comenius University, Bratislava, Slovak Republic
Venue:
Information Processing Letters
Year:
2003

Citing 8
Cited 8

Feedback vertex sets and cyclically reducible graphs

Journal of the ACM (JACM)
On the feedback vertex set problem in permutation graphs

Information Processing Letters
A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters
Decycling graphs

Journal of Graph Theory
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

SIAM Journal on Computing
Almost exact minimum feedback vertex set in meshes and butterflies

Information Processing Letters
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Feedback vertex set in hypercubes

Information Processing Letters

New upper bounds on feedback vertex numbers in butterflies

Information Processing Letters
Feedback vertex sets in mesh-based networks

Theoretical Computer Science
An efficient algorithm for minimum feedback vertex sets in rotator graphs

Information Processing Letters
Feedback numbers of de Bruijn digraphs

Computers & Mathematics with Applications
Two hardness results on feedback vertex sets

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tractable feedback vertex sets in restricted bipartite graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Feedback vertex sets in rotator graphs

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Feedback vertex sets on restricted bipartite graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a graph G , the problem is to construct a smallest subset S of vertices whose deletion results in an acyclic subgraph. The set S is called a minimum feedback vertex set for G . Tight upper and lower bounds on the cardinality of minimum feedback vertex sets have been previously obtained for some hypercube-like networks, such as meshes, tori, butterflies, cube-connected cycles and hypercubes. In this paper we construct minimum feedback vertex sets and determine their cardinalities in certain shuffle-based interconnection networks, such as shuffle-exchange, de Bruijn and Kautz networks.