From post

Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.

, и . TAMC, том 3959 из Lecture Notes in Computer Science, стр. 206-216. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks., и . IEEE Trans. Parallel Distributed Syst., 16 (8): 702-713 (2005)A high-performance switch architecture based on mesh of trees., , и . Int. J. Commun. Syst., 26 (12): 1543-1561 (2013)An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-Wireless Networks., и . Ad Hoc Sens. Wirel. Networks, 10 (4): 253-265 (2010)Optimized scheduling and mapping of logarithm and arctangent functions on TI TMS320C67X processor., , , и . ICASSP, стр. 3156-3159. IEEE, (2002)A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars., , и . ISPAN, стр. 230-235. IEEE Computer Society, (2005)Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations., и . TAMC, том 3959 из Lecture Notes in Computer Science, стр. 206-216. Springer, (2006)An Efficient General In-Place Parallel Sorting Scheme., , и . J. Supercomput., 14 (1): 5-17 (1999)Segmentation and recognition of motion streams by similarity search., , и . ACM Trans. Multim. Comput. Commun. Appl., 3 (3): 16 (2007)Parallel Routing and Wavelength Assignment for Optical Multistage Interconnection Networks., и . ICPP, стр. 214-221. IEEE Computer Society, (2004)Parallel Routing Algorithms for Nonblocking Electronic and Photonic Multistage Switching Networks., и . IPDPS, IEEE Computer Society, (2004)