Feedback vertex sets in mesh-based networks
From MaRDI portal
Publication:2383604
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1744105 (Why is no real title available?)
- A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Almost exact minimum feedback vertex set in meshes and butterflies
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Approximation algorithms for combinatorial problems
- Feedback vertex set in hypercubes
- Feedback vertex sets and cyclically reducible graphs
- Incomplete hypercubes: Embeddings of tree-related networks
- Minimum feedback vertex set and acyclic coloring.
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- Minimum feedback vertex sets in shuffle-based interconnection networks
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- New lower bound techniques for VLSI
- On locating minimum feedback vertex sets
- On the feedback vertex set problem in permutation graphs
- Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- Real-time emulations of bounded-degree networks
- Size bounds for dynamic monopolies
- Solving the feedback vertex set problem on undirected graphs
- Structural Information and Communication Complexity
- Wavelength conversion in optical networks
Cited in
(4)
This page was built for publication: Feedback vertex sets in mesh-based networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383604)