It is shown that any hierarchical switching system can be modeled by a special class of flow networks called unit networks. Using the results available for finding maximum flow through a unit network, a time-slot assignment (TSA) algorithm that runs in O(min(L,M/sup 2/)*min(N, square root M)*M/sup 2/) time is presented. This is an O(max(M/N, square root M)) improvement over the TSA algorithm proposed by M.A. Bonucelli (1989).>
No takes yet. Share an insight, caveat, or question.
Chalasani et al. (1993) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: