CANDAR'21
Update 2021-11-30
The 2021 Graph Golf Workshop had been held in conjunction with CANDAR'21 in November 24, 2021.
There were 91 valid submissions for the 2021 competition. The winners were invited to the workshop to receive the certificates and give technical talks on their contributions.
|
|
Winner's Talks
-
Masahiro Nakao (RIKEN Center for Computational Science), Masaki Tsukamoto and Yoshiko Hanada (Kansai University)
"Graph optimization algorithm with symmetry and biased host density for Order/Radix Problem"
-
Robert Waniek (Technische Universität Berlin)
"Using Mixed-Integer-Programming on the Order-Degree-Problem"
-
Yoshiki Satotani and Norikazu Takahashi (Okayama University)
"Finding a Generalized Moore Graph Using Randomized Depth-First Search"
Organizer's Talk
-
Michihiro Koibuchi (National Institute of Informatics)
"Discovery of the indirect network with the smallest theoretical diameter in the Graph Golf, a competition to find graphs leading to the efficient design of supercomputers."
Releases
-
NII news release
Discovery of the indirect network with the smallest theoretical diameter in the Graph Golf, a competition to find graphs leading to the efficient design of supercomputers.
Related Publications
Check out the Papers page!