Almost exact minimum feedback vertex set in meshes and butterflies
From MaRDI portal
Publication:1129019
DOI10.1016/S0020-0190(98)00039-8zbMATH Open0925.68196OpenAlexW1978731130MaRDI QIDQ1129019FDOQ1129019
Authors: Flaminia L. Luccio 
Publication date: 13 August 1998
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00039-8
Cites Work
- Title not available (Why is that?)
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- On the feedback vertex set problem in permutation graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- On locating minimum feedback vertex sets
- Size bounds for dynamic monopolies
- Title not available (Why is that?)
Cited In (28)
- Triggering cascades on undirected connected graphs
- Acyclic sum-list-colouring of grids and other classes of graphs
- An efficient algorithm for minimum feedback vertex sets in rotator graphs
- Minimum feedback vertex sets in shuffle-based interconnection networks
- The decycling number of \(P_m\square P^\ast_n\)
- New upper bounds on feedback vertex numbers in butterflies
- On reversible cascades in scale-free and Erdős-Rényi random graphs
- Solving the feedback vertex set problem on undirected graphs
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Feedback vertex set in hypercubes
- A feedback vertex set of 2-degenerate graphs
- Feedback vertex sets on restricted bipartite graphs
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
- Feedback vertex sets in star graphs
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- Feedback vertex sets in mesh-based networks
- The integrity of a cubic graph
- Minimum feedback vertex set and acyclic coloring.
- Decycling bipartite graphs
- The size of graphs with given feedback vertex number
- Dynamic monopolies and feedback vertex sets in hexagonal grids
- Feedback numbers of Kautz digraphs
- Feedback numbers of de Bruijn digraphs
- Triggering cascades on strongly connected directed graphs
- Target set selection on generalized pancake graphs
- Two Hardness Results on Feedback Vertex Sets
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis
This page was built for publication: Almost exact minimum feedback vertex set in meshes and butterflies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129019)
