Multiple combinatorial block diagrams

DOI10.1134/S000511791306009XMaRDI QIDQ462013zbMATH OpenFDO

Authors P. P. Parkhomenko, M. F. Karavai

Publication date 15 October 2014

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorics on words (68R15)

Recommendations

• Algorithmizing design of a class of combinatorial block diagrams
• On the synthesis of systems possessing the structure of some combinatorial designs
• scientific article; zbMATH DE number 7418
• scientific article; zbMATH DE number 3999929
• scientific article; zbMATH DE number 1532276

Cites work

• Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
• Fault-tolerant expansion of system area networks in multiprocessor computer systems

Cited in

(5)

• All isomorphic distinct cases for multi-component interfaces in a block.
• scientific article; zbMATH DE number 7418 (Why is no real title available?)
• On the synthesis of systems possessing the structure of some combinatorial designs
• Algorithmizing design of a class of combinatorial block diagrams
• Block combinatorics

This page was built for publication: Multiple combinatorial block diagrams

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