Sciweavers

2079 search results - page 77 / 416
» Universality of random graphs
Sort
View
SODA
2008
ACM
133views Algorithms» more  SODA 2008»
15 years 5 months ago
On the connectivity of dynamic random geometric graphs
Josep Díaz, Dieter Mitsche, Xavier Pé...
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
15 years 5 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...