Feedback numbers of de Bruijn digraphs
From MaRDI portal
Publication:980262
DOI10.1016/j.camwa.2009.10.021zbMath1189.05166OpenAlexW1975145864MaRDI QIDQ980262
Yongchang Cao, Jun-Ming Xu, Xirong Xu, Ye-Zhou Wu
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.021
Related Items
The decycling number of $P_{m} \square P_{n}^{\ast}$ ⋮ New bounds on the decycling number of generalized de Bruijn digraphs ⋮ On the decycling number of generalized Kautz digraphs ⋮ Feedback vertex number of Sierpiński-type graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feedback vertex set in hypercubes
- Feedback numbers of Kautz digraphs
- Minimum feedback vertex sets in shuffle-based interconnection networks
- Maximum induced trees in graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- On the feedback vertex set problem in permutation graphs
- De Bruijn and Kautz digraphs of a rooted tree
- Feedback vertex sets and cyclically reducible graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Decycling graphs
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Minimal feedback vertex sets in directed split‐stars
- The Lattice Point Covering Theorem for Rectangles
