Dr. YOUNG-MIN KANG – Tongmyong University, South Korea
Bio: YOUNG-MIN KANG received the B.S.,M.S., and Ph.D. degrees in computer science from Pusan National University. From January 2002 to July 2002, he was a Temporary Researcher with the MIRALab for virtual clothing project. In 2003, he joined Electronics and Telecommunications Research Institute (ETRI). In 2005, he moved to Tongmyong University.
He was the Director of the Industry-Academy Cooperation Foundation, the Head of Information and Computing Center, the Director of the Advancement of College Education (ACE) project, and Dean of the Planning Office in Tongmyong University. He has been a Full Professor since 2013. He worked as a dispatched researcher with the AI Research Laboratory, ETRI, from September 2020 to August 2021. He is currently Head of two departments, the Department of Game Engineering and the Department of Game Graphic Design in Tongmyong University.
THE PRESENTATION
Title: Arbitrary-order Reachability Computation for Large Graph Structures
Abstract: Reachability query in large-scale graphs is a challenging problem. In this presentation, a novel approach to arbitrary-order reachability computation with matrix multiplication is proposed. The method is intuitive and significantly outperforms the currently known methods in terms of computation time. The arbitrary-order nature of the proposed method enables efficient applications to be devised for dealing with actual real-world problems with massively large entities connected with each other. The method can be exploited as an approximate measure of the ground truth computation which requires too much computation resources and time.