Feedback vertex sets in mesh-based networks

DOI10.1016/J.TCS.2007.03.051MaRDI QIDQ2383604zbMATH OpenOpenAlexWikidataFDO

Authors Flaminia L. Luccio, Jop F. Sibeyn

Publication date 19 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.051

zbMATH Keywords

combinatorial optimizationpyramidfeedback vertex setmesh of treestree of meshes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Structural Information and Communication Complexity
• Minimum feedback vertex sets in shuffle-based interconnection networks
• Feedback vertex set in hypercubes
• Feedback vertex set on planar graphs
• scientific article; zbMATH DE number 6002502

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)

• Minimum feedback vertex sets in shuffle-based interconnection networks
• Feedback vertex set in hypercubes
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 6002502 (Why is no real title available?)

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)