咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 1 篇 equivalence
  • 1 篇 graph reachabili...
  • 1 篇 regu-lar express...
  • 1 篇 containment
  • 1 篇 minimization
  • 1 篇 graph pattern qu...

机构

  • 1 篇 department of co...
  • 1 篇 qatar computing ...
  • 1 篇 nlsde lab beihan...
  • 1 篇 school of inform...

作者

  • 1 篇 jianzhong li
  • 1 篇 nan tang
  • 1 篇 yinghui wu
  • 1 篇 shuai ma
  • 1 篇 wenfei fan

语言

  • 1 篇 英文
检索条件"主题词=graph reachability"
1 条 记 录,以下是1-10 订阅
排序:
Adding regular expressions to graph reachability and pattern queries
收藏 引用
Frontiers of Computer Science 2012年 第3期6卷 313-338页
作者: Wenfei FAN Jianzhong LI Shuai MA Nan TANG Yinghui WU School of Informatics University of EdinburghEdinburgh EH89YLUK Department of Computer Science and Engineering Harbin Institute of TechnologyHarbin 150001China NLSDE Lab Beihang UniversityBeijing 100919China Qatar Computing Research Institute Qatar FoundationDohaQatar
It is increasingly common to find graphs in which edges are of different types, indicating a variety of relation- ships. For such graphs we propose a class of reachability queries and a class of graph patterns, in whi... 详细信息
来源: 维普期刊数据库 维普期刊数据库 评论