Feedback vertex set in hypercubes
DOI10.1016/S0020-0190(00)00127-7zbMATH Open1338.68218WikidataQ57832155 ScholiaQ57832155MaRDI QIDQ294845FDOQ294845
Authors: Riccardo Focardi, Flaminia L. Luccio, David Peleg 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001277?np=y
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Almost exact minimum feedback vertex set in meshes and butterflies
- Size bounds for dynamic monopolies
- Feedback vertex sets and cyclically reducible graphs
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
Cited In (32)
- The feedback number of crossed cube networks
- An efficient algorithm for minimum feedback vertex sets in rotator graphs
- Minimum feedback vertex sets in shuffle-based interconnection networks
- Induced forests in some distance-regular graphs
- The decycling number of \(P_m\square P^\ast_n\)
- New upper bounds on feedback vertex numbers in butterflies
- New formulae for the decycling number of graphs
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- A feedback vertex set of 2-degenerate graphs
- A new formula for the decycling number of regular graphs
- Feedback vertex sets on restricted bipartite graphs
- On the bounds of feedback numbers of \((n,k)\)-star graphs
- Maximum induced forests of product graphs
- Feedback vertex sets in cubic multigraphs
- Feedback vertex sets in star graphs
- Minimum feedback arc sets in rotator and incomplete rotator graphs
- Feedback vertex sets in mesh-based networks
- New bounds on the decycling number of generalized de Bruijn digraphs
- On the decycling number of generalized Kautz digraphs
- The decycling number of generalized Petersen graphs
- Structural Information and Communication Complexity
- 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
- Decycling bubble sort graphs
- Feedback vertex number of Sierpiński-type 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: Feedback vertex set in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294845)
