咨询与建议

限定检索结果

文献类型

  • 363 篇 期刊文献
  • 145 篇 会议
  • 10 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 409 篇 工学
    • 379 篇 计算机科学与技术...
    • 94 篇 软件工程
    • 64 篇 电气工程
    • 23 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 15 篇 控制科学与工程
    • 7 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 力学(可授工学、理...
  • 211 篇 理学
    • 189 篇 数学
    • 13 篇 生物学
    • 7 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 37 篇 管理学
    • 34 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 12 篇 医学
    • 6 篇 临床医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 特种医学
  • 2 篇 文学
    • 2 篇 新闻传播学
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学

主题

  • 518 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 16 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 12 篇 minimum spanning...
  • 12 篇 shortest path
  • 11 篇 chordal graph
  • 11 篇 combinatorial op...
  • 10 篇 gpu
  • 9 篇 graph theory
  • 9 篇 ordering
  • 9 篇 parallel algorit...
  • 9 篇 network optimiza...
  • 8 篇 planar graph
  • 8 篇 interval graphs
  • 8 篇 reordering algor...
  • 7 篇 apx-complete

机构

  • 13 篇 tohoku univ grad...
  • 10 篇 univ elect sci &...
  • 7 篇 kyoto univ grad ...
  • 6 篇 indian inst tech...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 5 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 4 篇 univ sydney sch ...
  • 4 篇 osaka prefecture...
  • 4 篇 univ tokushima d...
  • 4 篇 mit comp sci & a...
  • 4 篇 otaru univ dept ...
  • 4 篇 fudan univ sch c...
  • 4 篇 univ bergen dept...
  • 4 篇 univ helsinki de...
  • 4 篇 shandong univ sc...
  • 3 篇 georgia inst tec...
  • 3 篇 tsinghua univ de...

作者

  • 25 篇 ito takehiro
  • 19 篇 nagamochi hirosh...
  • 16 篇 panda b. s.
  • 13 篇 ono hirotaka
  • 10 篇 zhou xiao
  • 10 篇 tarjan re
  • 9 篇 pandey arti
  • 9 篇 xiao mingyu
  • 8 篇 ishii toshimasa
  • 8 篇 otachi yota
  • 7 篇 suzuki akira
  • 7 篇 morsy ehab
  • 7 篇 zhang zhongzhi
  • 6 篇 uno yushi
  • 5 篇 paul s.
  • 5 篇 cui bin
  • 5 篇 kawahara jun
  • 5 篇 qin lu
  • 5 篇 chen lei
  • 5 篇 lin xuemin

语言

  • 459 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
518 条 记 录,以下是201-210 订阅
排序:
Bounding Stability in Formal Concept Analysis  1st
Bounding Stability in Formal Concept Analysis
收藏 引用
1st International Conference on Advanced Computational and Communication Paradigms (ICACCP)
作者: Bhuyan, Bikram P. Karmakar, Arindam Hazarika, Shyamanta M. Asian Inst Management & Technol Gauhati Assam India Tezpur Univ Biomimet & Cognit Robot Lab Comp Sci & Engn Tezpur Assam India Indian Inst Technol Guwahati Dept Mech Engn Gauhati India
In Formal Concept Analysis, stability is an important utility measure to rank concepts. However, computation of stability is considered to be a hard problem. Efficient algorithms having good bounds to estimate stabili... 详细信息
来源: 评论
Fast Exact CoSimRank Search on Evolving and Static graphs  18
Fast Exact CoSimRank Search on Evolving and Static Graphs
收藏 引用
27th World Wide Web (WWW) Conference
作者: Yu, Weiren Wang, Fan Aston Univ Birmingham B4 7ET W Midlands England
In real Web applications, CoSimRank has been proposed as a powerful measure of node-pair similarity based on graph topologies. However, existing work on CoSimRank is restricted to static graphs. When the graph is upda... 详细信息
来源: 评论
A High-Performance Connected Components Implementation for GPUs  18
A High-Performance Connected Components Implementation for G...
收藏 引用
27th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)
作者: Jaiganesh, Jayadharini Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA
Computing connected components is an important graph algorithm that is used, for example, in medicine, image processing, and biochemistry. This paper presents a fast connected-components implementation for GPUs called... 详细信息
来源: 评论
A dynamic programming algorithm for the maximum induced matching problem in permutation graphs  18
A dynamic programming algorithm for the maximum induced matc...
收藏 引用
9th International Symposium on Information and Communication Technology (SoICT)
作者: Viet-Dung Nguyen Ba-Thai Pham Viet-Hung Tran Phan-Thuan Do Korea Adv Inst Sci & Technol Daejeon South Korea Hanoi Univ Sci & Technol Hanoi Vietnam
For a finite undirected graph G = (V, E) and a positive integer k >= 1, an edge set M subset of E is a distance-k matching if the pairwise distance of edges in M is at least k in G. The special case k = 2 has been ... 详细信息
来源: 评论
Workload prediction and balance for distributed reachability processing for large-scale attribute graphs
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2018年 第6期30卷
作者: Ho, Li-Yung Wu, Jan-Jan Liu, Pangfeng Acad Sinica Inst Informat Sci 128Sect 2Acad Rd Taipei 11529 Taiwan Natl Taiwan Univ Dept Comp Sci & Informat Engn 1Sect 4Roosevelt Rd Taipei 10617 Taiwan Acad Sinica Res Ctr Informat Technol 128Sect 2Acad Rd Taipei 11529 Taiwan Natl Taiwan Univ Grad Inst Networking & Multimedia 1Sect 4Roosevelt Rd Taipei 10617 Taiwan
Reachability query with label constraint in an attribute graph is one of the most fundamental and important operations in semantic network analysis. However, ever-growing graph size has resulted in intractable reachab... 详细信息
来源: 评论
Recommendation system in E-commerce websites: A graph Based Approached  7
Recommendation system in E-commerce websites: A Graph Based ...
收藏 引用
7th IEEE International Advance Computing Conference (IACC)
作者: Shaikh, Shakila Rathi, Sheetal Janrao, Prachi TCET Comp Engn Dept Bombay Maharashtra India
this paper is regarding the lack of semantic factor in recommendation systems and describes the different recommendation techniques that are being employed in the current e-commerce website. Recommendation system can ... 详细信息
来源: 评论
graph-theory Based Simplification Techniques for Efficient Biological Network Analysis  3
Graph-theory Based Simplification Techniques for Efficient B...
收藏 引用
3rd IEEE International Conference on Big Data Computing Service and Applications (BigDataService)
作者: Ko, Euiseong Kang, Mingon Chang, Hyung Jae Kim, Donghyun Kennesaw State Univ Dept Comp Sci Marietta GA 30060 USA Troy Univ Montgomery Dept Comp Sci Montgomery AL USA
The recent years have witnessed the remarkable expansion of publicly available biological data in the related research fields. Many researches in these fields often require massive data to be analyzed by utilizing hig... 详细信息
来源: 评论
Enumerating Trillion Subgraphs On Distributed Systems
收藏 引用
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA 2018年 第6期12卷 71-71页
作者: Park, Ha-Myung Silvestri, Francesco Pagh, Rasmus Chung, Chin-Wan Myaeng, Sung-Hyon Kang, U. Korea Adv Inst Sci & Technol Daejeon South Korea Univ Padua Padua Italy IT Univ Copenhagen Copenhagen Denmark Chongqing Univ Technol Chongqing Peoples R China Seoul Natl Univ Seoul South Korea
How can we find patterns from an enormous graph with billions of vertices and edges? The subgraph enumeration, which is to find patterns from a graph, is an important task for graph data analysis with many application... 详细信息
来源: 评论
Maintaining balanced trees for structured distributed streaming systems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 232卷 176-188页
作者: Giroire, F. Modrzejewski, R. Nisse, N. Perennes, S. Univ Nice Sophia Antipolis CNRS I3S UMR 7271 F-06900 Sophia Antipolis France Google Dublin Ireland INRIA Rocquencourt France
In this paper, we propose and analyze a simple local algorithm to balance a tree. The motivation comes from live distributed streaming systems in which a source diffuses a content to peers via a tree, a node forwardin... 详细信息
来源: 评论
Sigcon: Simplifying a graph Based on Degree Correlation and Clustering Coefficient  19
Sigcon: Simplifying a Graph Based on Degree Correlation and ...
收藏 引用
19th IEEE International Conference on High Performance Computing and Communications (HPCC) / 15th IEEE International Conference on Smart City (SmartCity) / 3rd IEEE International Conference on Data Science and Systems (DSS)
作者: Jung, Hojin Kim, Songkuk Yonsei Univ Yonsei Inst Convergence Technol Sch Integrated Technol Incheon South Korea
Depicting a complex system like social networks as a graph helps understand its structure and relation. As advances in technology increase the amount of data, simplifying a large-scale graph has attracted interests. S... 详细信息
来源: 评论