- Ken-ichi
Kawarabayashi (****anese: 河原林 健一, born 1975) is a ****anese
graph theorist who
works as a
professor at the
National Institute of
Informatics and...
- 3 , 5 {\displaystyle K_{3,5}}
minor was
shown by Ken-ichi
Kawarabayashi, and
Kawarabayashi & Toft (2005)
proved the
existence of
either a K 7 {\displaystyle...
- of the
minor h. The
running time has been
improved to
quadratic by
Kawarabayashi, Kobayashi, and Reed. As a result, for
every minor-closed
family F,...
- de
Mendez (2012). Nešetřil &
Ossona de
Mendez (2012), pp. 319–321.
Kawarabayashi, Ken-ichi; Reed, Bruce; Wollan, Paul (2011), "The
graph minor algorithm...
-
Principles Of
Digital Communication II)" (PDF). MIT OpenCourseWare. 2005.
Kawarabayashi, Ken-ichi; Kobayashi, Yusuke; Reed,
Bruce (2012). "The
disjoint paths...
- nuclear-power.net.
Retrieved 27
January 2019. H. Tomita, C. Shoda, J.
Kawarabayashi, T. Matsumoto, J. Hori, S. Uno, M. Shoji, T. Uchida, N. ****umotoa and...
- that the
conjecture holds if G is (k+1)-connected. In 2002, Ken-ichi
Kawarabayashi proved that
under the
hypotheses of the conjecture, L is
either contained...
- PMID 1800950. S2CID 36706540. Itoh C,
Watanabe M,
Nagamatsu A,
Soeda S,
Kawarabayashi T,
Shimeno H (January 1997). "Two
molecular species of
oxytocinase (L-cystine...
-
their recognition, but not for
actually constructing an embedding.
Kawarabayashi,
Kreutzer &
Mohar (2010)
described a
linear time
algorithm that tests...
- [cs.LG]. Xu, Keyulu; Li, Chengtao; Tian, Yonglong; Sonobe, Tomohiro;
Kawarabayashi, Ken-ichi; Jegelka,
Stefanie (2018). "Representation
Learning on Graphs...
