scientific article; zbMATH DE number 1532276
From MaRDI portal
Publication:4517682
zbMATH Open0960.05009MaRDI QIDQ4517682FDOQ4517682
Authors:
Publication date: 11 March 2001
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1342086
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- scientific article; zbMATH DE number 568784
- scientific article; zbMATH DE number 140108
- Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Applications of design theory to circuits and networks (94C30)
Cited In (7)
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS
- Title not available (Why is that?)
- SOFSEM 2006: Theory and Practice of Computer Science
- Multiple combinatorial block diagrams
- Design networks with bounded pairwise distance
- A note on implementing combining networks
- A new approach to the design of coupling networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517682)
