The interconnection problem
From MaRDI portal
Publication:1208922
DOI10.1016/0022-0000(93)90047-ZzbMATH Open0776.68095OpenAlexW1974887678MaRDI QIDQ1208922FDOQ1208922
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)
Cites Work
Cited In (2)
Recommendations
- On the complexity of optimal bused interconnections π π
- Optimal interconnection in digital systems satisfying concurrency constraints π π
- Title not available (Why is that?) π π
- Two algorithms for the subset interconnection design problem π π
- Universality considerations in VLSI circuits π π
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)