Seminars in March 2009

  • Jack Koolen, Some topics in spectral graph theory

    Some topics in spectral graph theory
    Jack Koolen
    Department of Mathematics, POSTECH, Pohang, Korea</a>
    2009/03/27 Fri 5PM-6PM (Room 2411)
    In spectral graph theory one studies the eigenvalues (and spectrum) of the adjacency matrix and how they are related with combinatorial properties of the underlying graph.
    In this talk, I will discuss several topics in spectral graph theory.
    Tags:
  • Kunsoo Park (박근수), An effective web crawling ordering from graph search techniques

    An effective web crawling ordering from graph search techniques
    Kunsoo Park (박근수)
    School of Computer Science and Engineering, Seoul National University</a>
    2009/03/16 Mon, 2PM-3PM
    A web crawler is a fundamental software which iteratively downloads web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been studied. In this talk we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then find the best web crawling ordering among them. Furthermore, we treat internal links and external links in different manners for effective crawling. For maximum cardinality search and lexicographic breadth-first search, we present linear time algorithms based on the partition refinement method. Experimental results show that maximum cardinality search is the best graph search technique for web crawlers.
    Tags:

Monthly Archives