Massive Graphs: Algorithms, Techniques and Challenges
Recent advances in information and communication technologies have shown dramatic improvement and unparalleled development of our networked world. Almost all humans are interconnected and beyond that, all objects of our environment are becoming networked, forming huge global system. Massive graphs have been changing the traditional notion of efficient algorithms (in terms of processing time) from polynomial to sub-linear solutions by considering only a portion of the network. In this talk, I will overview algorithms, techniques and challenges for analyses of massive graphs by considering those methods and tools that allow massive graphs problems to be tackled not only on expensive supercomputing infrastructure, but also on more available, off-the shelf equipment.
About the lecturer
Ljupco Kocarev is a full professor at the Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, and research professor at University of California San Diego (UCSD), USA. His scientific interests include network science, machine learning, nonlinear systems and circuits; dynamical systems, mathematical modeling, and computational biology. He has co-authored more than 150 journal papers in 30 different international journals, ranging from mathematics to physics and from electrical engineering to computer sciences. According to Science Citation Index his work has been cited more than 6000 times, while according to Google scholar his work has been cited almost 12000 times. He is a fellow of IEEE, member of the Macedonian Academy of Sciences and Arts, and member of several other academies worldwide.