首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Space-efficient Basic Graph Algorithms
  • 本地全文:下载
  • 作者:Amr Elmasry ; Torben Hagerup ; Frank Kammer
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2015
  • 卷号:30
  • 页码:288-301
  • DOI:10.4230/LIPIcs.STACS.2015.288
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that. For computing connected components and performing breadth-first search, we match the running times of standard algorithms that have no memory restrictions, for depth-first search and related problems we come within a factor of \Theta(\log\log n), and for computing minimum spanning forests and single-source shortest-paths trees we come close for sparse input graphs.
  • 关键词:graph algorithms; depth-first search; single-source shortest paths; register input model
国家哲学社会科学文献中心版权所有