咨询与建议

限定检索结果

文献类型

  • 362 篇 期刊文献
  • 146 篇 会议
  • 10 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 409 篇 工学
    • 380 篇 计算机科学与技术...
    • 94 篇 软件工程
    • 64 篇 电气工程
    • 24 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 16 篇 控制科学与工程
    • 6 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 光学工程
  • 212 篇 理学
    • 190 篇 数学
    • 13 篇 生物学
    • 8 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 38 篇 管理学
    • 35 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 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

语言

  • 458 篇 英文
  • 58 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
518 条 记 录,以下是321-330 订阅
排序:
Approximating optimum branchings in linear time
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第3期109卷 175-178页
作者: Ziegler, Valentin Humboldt Univ Inst Informat D-10099 Berlin Germany
We prove that maximum weight branchings in directed graphs can be approximated in time O(m) tip to a factor of 1 - epsilon. where epsilon > 0 is an arbitrary constant. (C) 2008 Elsevier B.V. All rights reserved.
来源: 评论
AN IMPROVED algorithm FOR HIERARCHICAL-CLUSTERING USING STRONG COMPONENTS
收藏 引用
INFORMATION PROCESSING LETTERS 1983年 第1期17卷 37-41页
作者: TARJAN, RE Bell Laboratories Murray Hill NJ 07974 U.S.A.
Tarjan (1982) proposed a time algorithm for computing decomposition trees. That algorithm achieved its speed by combining 3 techniques: 1. the O(m) time algorithm for locating strong components, 2. divide-and-conqu... 详细信息
来源: 评论
AN OPTIMAL algorithm FOR SINK-FINDING
收藏 引用
INFORMATION PROCESSING LETTERS 1982年 第3期14卷 109-111页
作者: KING, KN SMITHTHOMAS, B School of Information and Computer Science Georgia Institute of Technology Atlanta GA 30332 U.S.A.
The problem of sink-finding in a directed graph represented by an adjacency matrix, was first introduced as a counterexample to an early version of the Anderaa-Rosenberg (1973) conjecture, which stated that, for P a &... 详细信息
来源: 评论
graph BLAST: A High-Performance Linear Algebra-based graph Framework on the GPU
收藏 引用
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2022年 第1期48卷 1-1页
作者: Yang, Carl Buluc, Aydin Owens, John D. Univ Calif Davis 1 Shields Ave Davis CA 95616 USA Lawrence Berkeley Natl Lab Dept Elect & Comp Engn 1 Shields Ave Davis CA 95616 USA Lawrence Berkeley Natl Lab 1 Cyclotron Rd Berkeley CA 94720 USA Univ Calif Berkeley 1 Cyclotron Rd Berkeley CA 94720 USA Univ Calif Davis Dept Elect & Comp Engn 1 Shields Ave Davis CA 95616 USA
High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs because of three challenges: (1) the difficulty of coming up with graph building blocks, (2) load... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Use of reconstituted metabolic networks to assist in metabolomic data visualization and mining
收藏 引用
METABOLOMICS 2010年 第2期6卷 312-321页
作者: Jourdan, Fabien Cottret, Ludovic Huc, Laurence Wildridge, David Scheltema, Richard Hillenweck, Anne Barrett, Michael P. Zalko, Daniel Watson, David G. Debrauwer, Laurent Xenobiot INRA ENVT UMR1089 F-31000 Toulouse 3 France Univ Glasgow Div Infect & Immun Glasgow Biomed Res Ctr Glasgow Lanark Scotland Univ Glasgow Wellcome Trust Ctr Mol Parasitol Glasgow Biomed Res Ctr Glasgow Lanark Scotland Univ Groningen Groningen Bioinformat Ctr Groningen Netherlands Univ Strathclyde Strathclyde Inst Pharm & Biomed Sci Glasgow Lanark Scotland
Metabolomics experiments seldom achieve their aim of comprehensively covering the entire metabolome. However, important information can be gleaned even from sparse datasets, which can be facilitated by placing the res... 详细信息
来源: 评论
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
收藏 引用
JOURNAL OF DISCRETE algorithmS 2009年 第4期7卷 570-578页
作者: Ishii, Toshimasa Otaru Univ Dept Informat & Management Sci Otaru Hokkaido 0478501 Japan
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v is an element of V has a demand d(v) is an element of Z(+), and a cost c(v) is an element of R+, where Z(+) and ... 详细信息
来源: 评论
Extracting research communities from bibliographic data
收藏 引用
INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS 2012年 第1期16卷 25-34页
作者: Nakamura, Yushi Horiike, Toshihiko Kuboyama, Tetsuji Sakamoto, Hiroshi Kyushu Inst Technol 680-4 Kawazu Iizuka Fukuoka 8208502 Japan Gakushuin Univ Tokyo Japan JST PRESTO Kawaguchi Saitama Japan
We develop a research community extraction algorithm from large bibliographic data, which was preliminarily reported in Horiike et al. [10] and Nakamura et al. [18]. A research community in bibliographic data is consi... 详细信息
来源: 评论
TREE SPANNERS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1995年 第3期8卷 359-387页
作者: CAI, LZ CORNEIL, DG UNIV TORONTO DEPT COMP SCITORONTOON M5S 1A4CANADA
A tree t-spanner T of a graph G is a spanning tree in which the distance between every pair of vertices is at most t times their distance in G. This notion is motivated by applications in communication networks, distr... 详细信息
来源: 评论
Finding Islands on Encrypted graphs  31
Finding Islands on Encrypted Graphs
收藏 引用
31st IEEE Conference on Signal Processing and Communications Applications (SIU)
作者: Acir, Berker Onur, Ertan Onur, Cansu Betin ODTU Bilgisayar Muhendisligi Bolumu Ankara Turkiye ODTU Kriptografi Bolumu Uygulamali Matemat Enstitusu Ankara Turkiye Univ Waterloo David R Cheriton Sch Comp Sci Waterloo ON Canada
Cloud computing services have found widespread use recently. Offloading computations to public clouds has many benefits albeit harming the privacy of users and data. Homomorphic encryption facilitates cloud computing ... 详细信息
来源: 评论