咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 2 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 理学
    • 1 篇 数学
    • 1 篇 生物学
  • 1 篇 工学
    • 1 篇 计算机科学与技术...

主题

  • 2 篇 constant-work-sp...
  • 2 篇 in-place algorit...
  • 2 篇 cactus graph
  • 2 篇 shortest path
  • 1 篇 block graph
  • 1 篇 chromatic polyno...
  • 1 篇 clique-cactus gr...

机构

  • 1 篇 rice univ dept c...
  • 1 篇 rice univ comput...

作者

  • 2 篇 brimkov boris
  • 1 篇 hicks illya v.

语言

  • 1 篇 英文
  • 1 篇 其他
检索条件"主题词=Constant-work-space algorithm"
2 条 记 录,以下是1-10 订阅
排序:
Memory efficient algorithms for cactus graphs and block graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 第Part2期216卷 393-407页
作者: Brimkov, Boris Hicks, Illya V. Rice Univ Computat & Appl Math Houston TX 77005 USA
We present constant-work-space polynomial time algorithms for solving the shortest path problem, finding the chromatic polynomial, clique number, number of components, circumference, and girth of cactus graphs and blo... 详细信息
来源: 评论
Memory Efficient Shortest Path algorithms for Cactus Graphs
Memory Efficient Shortest Path Algorithms for Cactus Graphs
收藏 引用
9th International Symposium on Visual Computing (ISVC)
作者: Brimkov, Boris Rice Univ Dept Computat & Appl Math Houston TX 77005 USA
The shortest path problem is fundamental to many areas of image processing, and we present ways to solve it in environments where computation space is scarce. We propose two constant-work-space algorithms for solving ... 详细信息
来源: 评论