N. Funabiki and Y. Takefuji, "A parallel algorithm for time-slot assignment problems in TDM hierarchical switching systems," IEEE Trans. Comm., vol. 42, no. 10, October, pp. 2890-2898, 1994.  Home/Search   Document Not in Database   Summary   Related Articles

....of edges. Algorithms for the MST problem have been implemented and studied extensively with various refinements and novel data structures, for graphs of different orders and densities (see Chap. 13 in [3] Some recent papers have examined theoretical versus practical behavior of MST algorithms [15, 36, 47]. Algorithms for the MST problem have also been proposed for parallel machines in the past 20 years, and more recently, implemented [21, 26, 40] However, in many real life network optimization situations the MST is often required to satisfy some additional constraint. This additional constraint ....

....spanning trees. Discrete Applied Mathematics, 5:39 50, 1983. 14] P. M. Camerini, G. Galbiati, and F. Maffioli. The complexity of weighted constrained spanning trees. In Proc. Colloquia on Theory of Algorithms, P ecs, Hungary, pp. 53 101, 1984. J anos Bolyai Mathematical Society, Budapest. [15] P. M. Camerini, G. Galbiati, and F. Maffioli. Algorithms for finding optimum trees: Description, use, and evaluation. Annals of Operations Research, 13:265 397, 1988. 16] R. Chandrasekaran. Minimal ratio spanning tree. Networks, 7:335 342, 1977. 17] K. M. Chandy and T. Lo. The capacitated ....

[Article contains additional citation context not shown here]

N. Funabiki and Y. Takefuji, "A parallel algorithm for time-slot assignment problems in TDM hierarchical switching systems," IEEE Trans. Comm., vol. 42, no. 10, October, pp. 2890-2898, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC