K
Ken-ichi Kawarabayashi
Researcher at National Institute of Informatics
Publications - 407
Citations - 9449
Ken-ichi Kawarabayashi is an academic researcher from National Institute of Informatics. The author has contributed to research in topics: Planar graph & Graph minor. The author has an hindex of 44, co-authored 401 publications receiving 7981 citations. Previous affiliations of Ken-ichi Kawarabayashi include NII Holdings & Japan Society for the Promotion of Science.
Papers
More filters
Journal ArticleDOI
A coherent Ising machine for 2000-node optimization problems.
Takahiro Inagaki,Yoshitaka Haribara,Yoshitaka Haribara,Koji Igarashi,Tomohiro Sonobe,Tomohiro Sonobe,Shuhei Tamate,Toshimori Honjo,Alireza Marandi,Peter L. McMahon,Takeshi Umeki,Koji Enbutsu,Osamu Tadanaga,Hirokazu Takenouchi,Kazuyuki Aihara,Ken-ichi Kawarabayashi,Ken-ichi Kawarabayashi,Kyo Inoue,Shoko Utsunomiya,Hiroki Takesue +19 more
TL;DR: It is shown that an optical processing approach based on a network of coupled optical pulses in a ring fiber can be used to model and optimize large-scale Ising systems, and a coherent Ising machine outperformed simulated annealing in terms of accuracy and computation time for a 2000-node complete graph.
Proceedings Article
Representation Learning on Graphs with Jumping Knowledge Networks
TL;DR: In this paper, the authors explore an architecture called jumping knowledge (JK) networks that flexibly leverages, for each node, different neighborhood ranges to enable better structure-aware representation.
Posted Content
Representation Learning on Graphs with Jumping Knowledge Networks
TL;DR: In this paper, the authors explore an architecture called jumping knowledge (JK) networks that flexibly leverages, for each node, different neighborhood ranges to enable better structure-aware representation.
Proceedings ArticleDOI
Algorithmic graph minor theory: Decomposition, approximation, and coloring
TL;DR: A polynomial-time algorithm is developed using topological graph theory to decompose a graph into the structure guaranteed by the theorem: a clique-sum of pieces almost-embeddable into bounded-genus surfaces.
Journal ArticleDOI
The disjoint paths problem in quadratic time
TL;DR: The time complexity of all the algorithms with the most expensive part depending on Robertson and [email protected]?s algorithm can be improved to O(n^2), for example, the membership testing for minor-closed class of graphs.