咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 2 篇 工学
    • 2 篇 计算机科学与技术...
    • 2 篇 软件工程

主题

  • 2 篇 pregel
  • 2 篇 distributed syst...
  • 2 篇 big data process...
  • 2 篇 max-flow min-cut...

机构

  • 2 篇 anna univ dept c...
  • 2 篇 chung ang univ d...
  • 2 篇 anna univ dept i...

作者

  • 2 篇 mukherjee saswat...
  • 2 篇 jung jason j.
  • 2 篇 ramesh varun
  • 2 篇 nagarajan shivan...

语言

  • 2 篇 英文
检索条件"主题词=max-flow min-cut algorithm"
2 条 记 录,以下是1-10 订阅
排序:
max-flow min-cut algorithm with application to road networks
Max-flow min-cut algorithm with application to road networks
收藏 引用
1st International Workshop on Data mining on Internet of Things (IoT) Systems
作者: Ramesh, Varun Nagarajan, Shivanee Jung, Jason J. Mukherjee, Saswati Anna Univ Dept Comp Sci & Engn Madras Tamil Nadu India Chung Ang Univ Dept Comp Sci Engn Seoul South Korea Anna Univ Dept Informat Sci & Technol Chennai Tamil Nadu India
The max-flow min-cut problem is one of the most explored and studied problems in the area of combinatorial algorithms and optimization. In this paper, we solve the max-flow min-cut problem on large random lognormal gr... 详细信息
来源: 评论
max-flow min-cut algorithm with application to road networks
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年 第11期29卷
作者: Ramesh, Varun Nagarajan, Shivanee Jung, Jason J. Mukherjee, Saswati Anna Univ Dept Comp Sci & Engn Madras Tamil Nadu India Chung Ang Univ Dept Comp Sci Engn Seoul South Korea Anna Univ Dept Informat Sci & Technol Chennai Tamil Nadu India
The max-flow min-cut problem is one of the most explored and studied problems in the area of combinatorial algorithms and optimization. In this paper, we solve the max-flow min-cut problem on large random lognormal gr... 详细信息
来源: 评论