Scalability of routing methods in ad hoc networks
Performance Evaluation - Performance 2005
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
ACM SIGMETRICS Performance Evaluation Review
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
ACM SIGMETRICS Performance Evaluation Review
Generalizing Kronecker graphs in order to model searchable networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
k-chordal graphs: from cops and robber to compact routing via treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |