Sciweavers

1542 search results - page 84 / 309
» The metamathematics of random graphs
Sort
View
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
15 years 3 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...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 3 months ago
Random lifts of graphs
Alon Amit, Nathan Linial, Jirí Matousek, Ey...