17 Mar
2015
17 Mar
'15
10:24 a.m.
Hi Everyone, I'm Tanuj Kr Aasawat, a final year student of Information Technology (B.E.). I would like to work on implementing a graph container with at least the following features: size, insert, delete, bfs and dfs. In the later part, would like to work on optimising bfs, using parallel computing techniques. In recent years, we have seen that major research is going on optimising the search operations for real world graphs (including RMAT graph and LiveJournal graph). Anticipating positive reply from your side. Thanks and Regards, Tanuj Kr Aasawat Deptt. of I.T, Jadavpur University, India Mitacs Globalink Research Intern, University of British Columbia, Vancouver, Canada