May 30, 2017 20:15


Speaker: Andrea Marino (University of Pisa, Italy)

Title: Enumeration Algorithms: Introduction and Techniques

The development of algorithms for enumerating all possible solutions of a specific combinatorial problem has a long history: already in the 1960s the problem of enumerating some specific graph-theoretic structures (such shortest paths and cycles) has been attacked. This new interest towards graph enumeration comes from the analysis of biological (and, more in general, of complex) networks. The main goal of this talk is revising the basics of graph enumeration, summarizing the efficiency measures and the main current available algorithm design techniques.

More Information

Date June 7, 2017 (Wed) 15:00 - 16:00


Nihonbashi 1-chome Mitsui Building, 15th floor, 1-4-1 Nihonbashi, Chuo-ku, Tokyo 103-0027, Japan(Google Maps)