The interconnection problem

DOI10.1016/0022-0000(93)90047-ZMaRDI QIDQ1208922zbMATH OpenOpenAlexFDO

Authors Klaus Jansen

Publication date 16 May 1993

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(93)90047-z

zbMATH Keywords

NP-completeinterconnectionbus architecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Recommendations

• On the complexity of optimal bused interconnections
• Optimal interconnection in digital systems satisfying concurrency constraints
• scientific article; zbMATH DE number 3985121
• Two algorithms for the subset interconnection design problem
• Universality considerations in VLSI circuits

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3566230 (Why is no real title available?)
• The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design

Cited in

(6)

• Optimal interconnection in digital systems satisfying concurrency constraints
• Optimal realization of sets of interconnection functions on synchronous multiple bus systems
• Effective and efficient data reduction for the subset interconnection design problem
• On the complexity of optimal bused interconnections
• Algorithms and Implementation for Interconnection Graph Problem
• A minimization version of a directed subgraph homeomorphism problem

This page was built for publication: The interconnection problem

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