Algorithms and Implementation for Interconnection Graph Problem
From MaRDI portal
Publication:5505659
DOI10.1007/978-3-540-85097-7_19zbMath1168.68444OpenAlexW22994886MaRDI QIDQ5505659
Yu-Liang Wu, Christian Hundt, Jason Ernst, Hong Bing 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
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
This page was built for publication: Algorithms and Implementation for Interconnection Graph Problem
