On the robustness of interconnections in random graphs: a symbolic approach
Theoretical Computer Science
Trade-Offs between Density and Robustness in Random Interconnection Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |