M.Tech I Year II Semester (R22)
Upon the Successful Completion of the Course, the Students would be able to:
Introduction and Application of Large-scale Graph: Characteristics, Complex Data Sources - Social Networks, Simulations, Bioinformatics; Categories- Social, Endorsement, Location, Co-occurrence graphs; Graph Data structures, Parallel, Multicore and Graph Algorithms
A Work-Efficient Parallel Breadth-First Search Algorithm (or How To Cope With the Nondeterminism of Reducers), Multi-Objective Shortest Paths
Multicore Algorithms for Graph Connectivity Problems, Distributed Memory Parallel Algorithms for Massive Graphs, Massive-Scale Distributed Triangle Computation and Applications
Recent Advances in Scalable Network Generation, Computational Models for Cascades in Massive Graphs, Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling.
Graph Data Science Using Neo4j, A Cloud-Based Approach to Big Graphs, Interactive Graph Analytics at Scale in Arkouda
Loading Question Papers
Fetching data from database...