咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 515 篇 电子文献
  • 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 篇 农学

主题

  • 515 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 15 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 12 篇 shortest path
  • 11 篇 minimum spanning...
  • 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

语言

  • 456 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
515 条 记 录,以下是291-300 订阅
排序:
Efficient Cohesive Subgraphs Detection in Parallel  14
Efficient Cohesive Subgraphs Detection in Parallel
收藏 引用
ACM SIGMOD International Conference on Management of Data
作者: Shao, Yingxia Chen, Lei Cui, Bin Peking Univ Sch EECS MOE Key Lab High Confidence Software Technol Beijing Peoples R China HKUST Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China
A cohesive subgraph is a primary vehicle for massive graph analysis, and a newly introduced cohesive subgraph, k-truss, which is motivated by a natural observation of social cohesion, has attracted more and more atten... 详细信息
来源: 评论
Designing a Heuristic Cross-Architecture Combination for Breadth-First Search  43
Designing a Heuristic Cross-Architecture Combination for Bre...
收藏 引用
43rd Annual International Conference on Parallel Processing (ICPP)
作者: You, Yang Bader, David A. Dehnavi, Maryam Mehri Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Georgia Inst Technol Sch Computat Sci & Engn Atlanta GA 30332 USA MIT Comp Sci & Artificial Intelligence Lab Boston MA USA
Breadth-First Search (BFS) is widely used in real-world applications including computational biology, social networks, and electronic design automation. The most effective BFS approach has been shown to be a combinati... 详细信息
来源: 评论
A practical approach to generating route sketches  2
A practical approach to generating route sketches
收藏 引用
2nd ACM SIGSPATIAL International Workshop on MapInteraction, MapInteract 2014
作者: Luxen, Dennis Niklaus, Patrick Mapbox Inc. 1714 14th St NW Rear Entrance WashingtonDC20009 United States Karlsruhe Institute of Technology Am Fasanengarten 5 Karlsruhe76128 Germany
Online mapping and navigation services are a corner stone of the World Wide Web. While automatically generated car directions have gone from static data to user-specific customizations, automatically generated route g... 详细信息
来源: 评论
Computing the rooted triplet distance between galled trees by counting triangles
收藏 引用
JOURNAL OF DISCRETE algorithmS 2014年 25卷 66-78页
作者: Jansson, Jesper Lingas, Andrzej Kyoto Univ Inst Chem Res Lab Math Bioinformat Uji Kyoto 6110011 Japan Lund Univ Dept Comp Sci S-22100 Lund Sweden
We consider a generalization of the rooted triplet distance between two phylogenetic trees to two phylogenetic networks. We show that if each of the two given phylogenetic networks is a so-called galled tree with n le... 详细信息
来源: 评论
A graph-Based Approach to Find Teleconnections in Climate Data
收藏 引用
STATISTICAL ANALYSIS AND DATA MINING 2013年 第3期6卷 158-179页
作者: Kawale, Jaya Liess, Stefan Kumar, Arjun Steinbach, Michael Snyder, Peter Kumar, Vipin Ganguly, Auroop R. Samatova, Nagiza F. Semazzi, Fredrick Univ Minnesota Dept Comp Sci Minneapolis MN 55455 USA Univ Minnesota Dept Soil Water & Climate St Paul MN 55108 USA Northeastern Univ Civil & Environm Engn Boston MA 02115 USA N Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA N Carolina State Univ Dept Marine Earth & Atmospher Sci Raleigh NC 27695 USA
Pressure dipoles are important long distance climate phenomena (teleconnection) characterized by pressure anomalies of the opposite polarity appearing at two different locations at the same time. Such dipoles have bee... 详细信息
来源: 评论
A Linear Time algorithm for L(2,1)-Labeling of Trees
收藏 引用
algorithmICA 2013年 第3期66卷 654-681页
作者: Hasunuma, Toru Ishii, Toshimasa Ono, Hirotaka Uno, Yushi Univ Tokushima Dept Math & Nat Sci Tokushima 7708502 Japan Hokkaido Univ Grad Sch Econ Div Modern Econ & Business Adm Sapporo Hokkaido 0600809 Japan Kyushu Univ Dept Econ Engn Fukuoka 8128581 Japan Osaka Prefecture Univ Grad Sch Sci Dept Math & Informat Sci Sakai Osaka 5998531 Japan
An L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of nonnegative integers such that |f(x)-f(y)|a parts per thousand yen2 if x and y are adjacent and |f(x)-f(y)|a parts per thousand... 详细信息
来源: 评论
Fast Invisible Triangle Culling Mechanism for 3D Rendering Hardware
收藏 引用
SENSOR LETTERS 2013年 第11期11卷 2086-2093页
作者: Chu, Slo-Li Hsiao, Chih-Chieh Chung Yuan Christian Univ Dept Informat & Comp Engn Chungli 32023 Taiwan
Current 3D graphics computing systems rely on a massive number of triangles to generate realistic images in embedded systems, on personal computers, and on high-performance workstations. Although the number of triangl... 详细信息
来源: 评论
Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra algorithms
收藏 引用
JOURNAL OF COMPUTING IN CIVIL ENGINEERING 2013年 第3期27卷 263-273页
作者: Pradhan, Anu Mahinthakumar, G. (Kumar) Drexel Univ Dept Civil Architectural & Environm Engn Philadelphia PA 19104 USA N Carolina State Univ Dept Civil Construct & Environm Engn Raleigh NC 27695 USA
Parallel computing has become a powerful approach for solving real-time decisions about large-scale, computing-intensive transportation problems. A frequently encountered transportation problem is the "shortest p... 详细信息
来源: 评论
Liar's domination in graphs: Complexity and algorithm
收藏 引用
DISCRETE APPLIED MATHEMATICS 2013年 第7-8期161卷 1085-1092页
作者: Panda, B. S. Paul, S. Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India
A set L subset of V (G) of a graph G = (V, E) is a liar's dominating set if (1) for all v is an element of V (G), vertical bar N-G[v]boolean AND L vertical bar >= 2 and (2) for every pair u, v is an element of ... 详细信息
来源: 评论
Shortest paths avoiding forbidden subpaths
收藏 引用
NETWORKS 2013年 第4期61卷 322-334页
作者: Ahmed, Mustaq Lubiw, Anna Google Inc Mountain View CA USA Univ Waterloo DRC Sch Comp Sci Waterloo ON N2L 3G1 Canada
We study a variant of the shortest path problem in graphs: given a weighted graph Gand vertices sand t, and given a set Xof forbidden paths in G, find a shortest s- tpath Psuch that no path in Xis a subpath of P. Path... 详细信息
来源: 评论