National Institute of Informatics, Japan
Title: From Graph Theory to some algorithmic applications
Abstract: In this talk, we will present several results that are based on some graph theoretical work, but can be applied to some other algorithmic problems,
including scheduling, shortest path, pagerank and similarity search. These applications are very useful in database, data mining, and machine learning research community.
We will also present some (graph) theoretical results, which may have some algorithmic applications.
Background
Professor, National Institute of Informatics and JST ERATO Kawarabayashi Project
Research Interests: Discrete Math and Theoretical Computer Science, AI, Graph Mining, Graph Data Base.