The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties

DOI10.1142/S0129054197000161MaRDI QIDQ4366866zbMATH OpenOpenAlexFDO

Authors H. K. Dai

Publication date 13 May 1998

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054197000161

zbMATH Keywords

interconnection networks

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of blocking (semi)total dominating sets with edge contractions
• A lower bound on strictly non-blocking networks
• On the complexity of an optimal non-blocking commutation scheme without reorganization
• Log/sub 2/ (N, m, p) strictly nonblocking networks
• Applications of the complexity space to the general probabilistic divide and conquer algorithms
• Tail bounds for occupancy and the satisfiability threshold conjecture
• ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM
• scientific article; zbMATH DE number 1418332
• Parameterized complexity of computing maximum minimal blocking and hitting sets

Cited in

(1)

• scientific article; zbMATH DE number 1334213 (Why is no real title available?)

This page was built for publication: The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties

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