Feedback vertex sets in mesh-based networks

Authors:
Flaminia L. Luccio;Jop F. Sibeyn
Affiliations:
Dipartimento di Informatica, Università Ca Foscari, Venezia, via Torino 155, 30172 Mestre (Ve), Italy;Institut für Informatik, Martin-Luther-Universität Halle, 06099 Halle, Germany
Venue:
Theoretical Computer Science
Year:
2007

Citing 21
Cited 0

Feedback vertex sets and cyclically reducible graphs

Journal of the ACM (JACM)
On locating minimum feedback vertex sets

Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Product-shuffle networks: toward reconciling shuffles and butterflies

Discrete Applied Mathematics - Special double volume: interconnection networks
On the feedback vertex set problem in permutation graphs

Information Processing Letters
Incomplete hypercubes: embeddings of tree-related networks

Journal of Parallel and Distributed Computing
A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters
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
Real-time emulations of bounded-degree networks

Information Processing Letters - Special issue on parallel models
Size bounds for dynamic monopolies

Discrete Applied Mathematics
Solving the feedback vertex set problem on undirected graphs

Discrete Applied Mathematics
Feedback vertex set in hypercubes

Information Processing Letters
Wavelength conversion in optical networks

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimum feedback vertex set and acyclic coloring

Information Processing Letters
New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Information Processing Letters
Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing

Parallel Computing
A Polyhedral Approach to the Feedback Vertex Set Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimum feedback vertex sets in shuffle-based interconnection networks

Information Processing Letters
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the minimum feedback vertex set problem in graphs, i.e., the problem of finding a minimal cardinality subset of the vertices, whose removal makes a graph acyclic. The problem is NP-hard for general topologies, but optimal and near-optimal solutions have been provided for particular networks. In this paper, the problem is considered for undirected graphs with the following topologies: two- and higher-dimensional meshes of trees, trees of meshes, and pyramid networks. For the two-dimensional meshes of trees the results are optimal; for the higher-dimensional meshes of trees and the tree of meshes the results are asymptotically optimal. For the pyramid networks, there remains a small factor between the upper and the lower bounds.