The interconnection problem

DOI10.1016/0022-0000(93)90047-ZzbMATH Open0776.68095OpenAlexW1974887678MaRDI QIDQ1208922FDOQ1208922

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design

Cited In (5)

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

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)