在线客服: 点击这里给我发消息  新用户使用步骤:会员注册→充值→重新登入→进入资源
标题:Graph learning with a nearest neighbor approach
时间:2019-02-11 21:44:01
DOI:10.1145/238061.238065
作者:Sven Koenig;Yury Smirnov
出版源: Conference on Computational Learning Theory ,1996
摘要:In this paper, we study how to traverse all edges of an unknown graph G=(V,E) that is bi-directed and strongly connected. This problem can be solved with a simple algorithm that traverses all edges at most twice, and no algorithm can do ...
大小:249 kb
页数:11 PAGES
下载: 点击下载
预览:

浏览器不支持嵌入PDF阅读,打开新页面在线阅读

本页内容由网络收集而来,版权归原创者所有,如有侵权请及时联系