{"id":183,"date":"2021-09-14T13:09:22","date_gmt":"2021-09-14T04:09:22","guid":{"rendered":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/?p=183"},"modified":"2021-09-14T13:10:13","modified_gmt":"2021-09-14T04:10:13","slug":"prof-kawarabayashi-ken-ichi-won-the-2021-fulkerson-prize","status":"publish","type":"post","link":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/183","title":{"rendered":"Prof. KAWARABAYASHI Ken-ichi won The 2021 Fulkerson Prize"},"content":{"rendered":"<ul>Prof. KAWARABAYASHI Ken-ichi won The 2021 Fulkerson Prize<\/ul>\n<ul>\n<li>Award<br \/>\nThe Fulkerson Prize<\/li>\n<li>Title<br \/>\nDeterministic Edge Connectivity in Near-Linear Time<\/li>\n<li>Name<br \/>\nKAWARABAYASHI Ken-ichi (NII)<br \/>\nMikkel Thorup(University of Copenhagen)<\/li>\n<li>The citation for the award<br \/>\n&#8220;Determining the edge connectivity of a graph is one of the most fundamental graph problems. Kawarabayashi and Thorup&#8217;s work does not just improve the running time of the algorithm, impressive as that is. Its main contributions are conceptual:the paper introduces powerful and impactful new ideas that will have a long-lasting influence on the field. The most powerful of these ideas is a fast deterministic sparsification that essentially preserves all the non-trivial minimum cuts of the graph. &#8220;<\/li>\n<li>Organization<br \/>\nMathematical Optimization Society<br \/>\nAmerican Mathematical Society<\/li>\n<li>Date<br \/>\nJuly 22, 2021<\/li>\n<\/ul>\n<ul>\n<li>Link<br \/>\n\u30fb<a href=\"https:\/\/www.ams.org\/news?news_id=6750\" target=\"_blank\" rel=\"noopener\">Fulkerson Prize awarded for work in discrete mathematics &#8211; AMS :: News from the AMS<\/a><br \/>\n\u30fb<a href=\"http:\/\/www.ams.org\/prizes-awards\/paview.cgi?parent_id=17\" target=\"_blank\" rel=\"noopener\">AMS :: Delbert Ray Fulkerson Prize (AMS-MOS)<\/a><br \/>\n\u30fb<a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3274663\" target=\"_blank\" rel=\"noopener\">Deterministic Edge Connectivity in Near-Linear Time\uff08Journal of the ACM Vol.66 No.1, 2018\uff09<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Prof. KAWARABAYASHI Ken-ichi won The 2021 Fulkerson Prize Award The Fulkerson Prize Title Deterministic Edge Connectivity in Near-Linear Time Name KAWARABAYASHI Ken-ichi (NII) Mikkel Thorup(University of Copenhagen) The citation for the award &#8220;Determining the edge connectivity of a graph is one of the most fundamental graph problems. Kawarabayashi and Thorup&#8217;s work does not just improve the running time of the algorithm, impressive as that is. Its main contributions are conceptual:the paper introduces powerful and impactful new ideas that will have a long-lasting influence on the field. The most powerful of these ideas is a fast deterministic sparsification that essentially preserves all the non-trivial minimum cuts of the graph. &#8220; Organization [&hellip;] <span class=\"excerpt_more\"><a href=\"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/183\" class=\"more-link\">MORE<\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-183","post","type-post","status-publish","format-standard","hentry","category-sub-news"],"_links":{"self":[{"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/posts\/183","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/comments?post=183"}],"version-history":[{"count":3,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/posts\/183\/revisions"}],"predecessor-version":[{"id":186,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/posts\/183\/revisions\/186"}],"wp:attachment":[{"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/media?parent=183"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/categories?post=183"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bigdata.nii.ac.jp\/kibans\/english\/wp-json\/wp\/v2\/tags?post=183"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}