咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是261-270 订阅
排序:
algorithms for the Independent Feedback Vertex Set Problem
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年 第6期E98A卷 1179-1188页
作者: Tamura, Yuma Ito, Takehiro Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan JST ERATO Kawarabayashi Large Graph Project Global Res Ctr Big Data MathNII Tokyo 1018430 Japan
A feedback vertex set F of an undirected graph G is a vertex subset of G whose removal results in a forest. Such a set F is said to be independent if F forms an independent set of G. In this paper, we study the proble... 详细信息
来源: 评论
The List Coloring Reconfiguration Problem for Bounded Pathwidth graphs
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年 第6期E98A卷 1168-1178页
作者: Hatanaka, Tatsuhiko Ito, Takehiro Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a list coloring, given a lis... 详细信息
来源: 评论
HAGP: A Hub-centric Asynchronous graph Processing Framework for Scale-free graph  15
HAGP: A Hub-centric Asynchronous Graph Processing Framework ...
收藏 引用
2015 15th IEEE ACM International Symposium on Cluster Cloud and Grid Computing (CCGrid 2015)
作者: Gao, Tao Lu, Yutong Zhang, Baida Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China
graph structure which is often used to model the relationship between the data items has drawn more and more attention. The graph datasets from many important domains have the property called scale-free. In the scale-... 详细信息
来源: 评论
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第1期575卷 33-41页
作者: Bhushan, Alka Sajith, G. Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India
The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Omega((E/V)Sort(V)) on the number of I/Os is shown for the problem, where V is ... 详细信息
来源: 评论
Linear-time algorithm for sliding tokens on trees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 600卷 132-142页
作者: Demaine, Erik D. Demaine, Martin L. Fox-Epstein, Eli Hoang, Duc A. Ito, Takehiro Ono, Hirotaka Otachic, Yota Uehara, Ryuhei Yamada, Takeshi MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Brown Univ Dept Comp Sci Providence RI 02912 USA Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa 9231292 Japan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan JST CREST Kawaguchi Saitama 3320012 Japan Kyushu Univ Fac Econ Higashi Ku Fukuoka 8128581 Japan
Suppose that we are given two independent sets I-b and I-r of a graph such that vertical bar l(b)vertical bar =vertical bar I-r vertical bar and imagine that a token is placed on each vertex in I-b. Then, the SLIDING ... 详细信息
来源: 评论
Note on property M(k) of some complete multipartite graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 228-231页
作者: Wang, Yanning Wang, Yanyan Zhang, Xuguang Yanshan Univ Sch Sci Qinhuangdao Hebei Peoples R China Yanshan Univ Sch Elect Engn Key Lab Ind Comp Control Engn Hebei Prov Qinhuangdao Hebei Peoples R China Yanshan Univ Sch Econ & Management Qinhuangdao Hebei Peoples R China
The property M(k) is a concept associated with the unique list coloring. A graph G has the property M(k) if for any collection of lists assigned to its vertices, each of size k, either there is no list coloring for G ... 详细信息
来源: 评论
algorithms for GA-H reduced graphs
收藏 引用
JOURNAL OF DISCRETE algorithmS 2015年 35卷 17-26页
作者: Gavril, Fanica Technion Dept Comp Sci IL-32000 Haifa Israel
Let GA be a hereditary family of graphs and Ha hereditary family of acyclically directed family of graphs. A graph G(V, E) is a GA-H reduced graph if it can be obtained from a graph GA(V, D) is an element of GA by del... 详细信息
来源: 评论
Fast and Scalable NUMA-based Thread Parallel Breadth-first Search  13
Fast and Scalable NUMA-based Thread Parallel Breadth-first S...
收藏 引用
International Conference on High Performance Computing and Simulation (HPCS)
作者: Yasui, Yuichiro Fujisawa, Katsuki Kyushu Univ Nishi Ku 744 Motooka Fukuoka 812 Japan JST COI Nishi Ku Fukuoka Japan JST CREST Nishi Ku Fukuoka Japan
The breadth-first search (BFS) is one of the most centric kernels in graph processing. Beamer's direction-optimizing BFS algorithm, which selects one of two traversal directions at each level, can reduce unnecessa... 详细信息
来源: 评论
Fast Sparse Matrix and Sparse Vector Multiplication algorithm on the GPU  29
Fast Sparse Matrix and Sparse Vector Multiplication Algorith...
收藏 引用
29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
作者: Yang, Carl Wang, Yangzihao Owens, John D. Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA
We implement a promising algorithm for sparse-matrix sparse-vector multiplication (SpMSpV) on the GPU. An efficient k-way merge lies at the heart of finding a fast parallel SpMSpV algorithm. We examine the scalability... 详细信息
来源: 评论
Divide & Conquer: I/O Efficient Depth-First Search  15
Divide & Conquer: I/O Efficient Depth-First Search
收藏 引用
ACM SIGMOD International Conference on Management of Data
作者: Zhang, Zhiwei Yu, Jeffrey Xu Qin, Lu Shang, Zechao Chinese Univ Hong Kong Hong Kong Peoples R China Univ Technol FEIT Ctr QCIS Sydney NSW Australia
Depth-First Search (DFS), which traverses a graph in the depth-first order, is one of the fundamental graph operations, and the result of DFS over all nodes in G is a spanning tree known as a D ES-Tree. There are many... 详细信息
来源: 评论