Feedback vertex sets in mesh-based networks

DOI10.1016/J.TCS.2007.03.051zbMATH Open1123.68093OpenAlexW2080982737WikidataQ57832118 ScholiaQ57832118MaRDI QIDQ2383604FDOQ2383604

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

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 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)

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?)
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• 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
• Minimum feedback vertex set and acyclic coloring.
• Wavelength conversion in optical networks
• Feedback vertex set in hypercubes
• 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
• Minimum feedback vertex sets in shuffle-based interconnection networks
• New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
• Title not available (Why is that?)
• New lower bound techniques for VLSI
• Solving the feedback vertex set problem on undirected graphs
• Real-time emulations of bounded-degree networks
• Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
• Incomplete hypercubes: Embeddings of tree-related networks
• Structural Information and Communication Complexity

Cited In (3)

• Minimum feedback vertex sets in shuffle-based interconnection networks
• Structural Information and Communication Complexity
• Title not available (Why is that?)

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)