Algorithms and Implementation for Interconnection Graph Problem

DOI10.1007/978-3-540-85097-7_19MaRDI QIDQ5505659zbMATH OpenOpenAlexFDO

Authors Christian Hundt, Yu-Liang Wu, Jason Ernst, Hongbing Fan

Publication date 27 January 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85097-7_19

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On complexity of subset interconnection designs
• scientific article; zbMATH DE number 4075121
• Two algorithms for the subset interconnection design problem
• High Performance Computing - HiPC 2003
• The interconnection problem

Cited in

(7)

• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
• Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
• A computational study of reduction techniques for the minimum connectivity inference problem
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
• Overlaying a hypergraph with a graph with bounded maximum degree
• Placing green bridges optimally, with a multivariate analysis
• On the complexity of community-aware network sparsification

This page was built for publication: Algorithms and Implementation for Interconnection Graph Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505659)