Graph Golf: The Order/degree Problem Competition

CANDAR'18

Update 2018-12-05

The 2018 Graph Golf Workshop had been held in conjunction with CANDAR'18 in November 27, 2018, in Hida Takayama, Japan.

There were 239 valid submissions for the 2018 competition. Among them we recognized five authors of four teams according to the final ranking. They were invited to the workshop to receive the certificates and give technical talks on their contributions.

Award Winners

Masahiro Nakao (RIKEN Center for Computational Science)
receives the General Graph Widest Improvement Award and the General Graph Deepest Improvement Award
Toru Koizumi (The University of Tokyo)
receives the General Graph Deepest Improvement Award
Teruaki Kitasuka (Hiroshima University) and Masahiro Iida (Kumamoto University)
receives the General Graph Deepest Improvement Award
EvbCFfp1XB (unknown affiliation)
receives the Grid Graph Widest Improvement Award and the Grid Graph Deepest Improvement Award

Keynote

Takeru Inoue (NTT Laboratories)
gives the keynote speech titled "Graph enumeration and its applications featuring compressed data structures".
Abstract: This talk presents subgraph enumeration techniques and their applications. Subgraph enumeration is a traditional but tough problem in computer science: finding all subgraphs in a graph under given constraints, e.g., paths, cycles, trees, degrees, size, and their combinations. Utilizing compressed data structures (i.e., decision diagrams), subgraph enumeration algorithms have recently been very fast, so as to solve several network problems including network optimization, fault analysis, and reliability evaluation. This talk also addresses an open-source software named Graphillion, which implements key enumeration algorithms like the frontier-based search.