New upper bounds on feedback vertex numbers in butterflies
From MaRDI portal
Publication:2390267
DOI10.1016/j.ipl.2004.03.005zbMath1192.68029OpenAlexW2044585412MaRDI QIDQ2390267
Chuan-Min Lee, Maw-Shang Chang, Chin-Hua Lin
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.005
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Feedback vertex set in hypercubes
- Minimum feedback vertex sets in shuffle-based interconnection networks
- Feedback vertex sets in star graphs
- The maximum k-colorable subgraph problem for chordal graphs
- On locating minimum feedback vertex sets
- Almost exact minimum feedback vertex set in meshes and butterflies
- The complexity of generalized clique covering
- On the feedback vertex set problem in permutation graphs
- Approximating minimum feedback vertex sets in hypergraphs
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- Solving the feedback vertex set problem on undirected graphs
- Wavelength Conversion in Optical Networks
- Feedback vertex sets and cyclically reducible graphs
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- Node-Deletion Problems on Bipartite Graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: New upper bounds on feedback vertex numbers in butterflies
