咨询与建议

限定检索结果

文献类型

  • 2,094 篇 期刊文献
  • 822 篇 会议
  • 24 篇 学位论文
  • 7 册 图书
  • 1 篇 资讯

馆藏范围

  • 2,947 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 2,331 篇 工学
    • 2,087 篇 计算机科学与技术...
    • 525 篇 软件工程
    • 349 篇 电气工程
    • 132 篇 测绘科学与技术
    • 131 篇 土木工程
    • 130 篇 信息与通信工程
    • 130 篇 建筑学
    • 79 篇 控制科学与工程
    • 34 篇 电子科学与技术(可...
    • 22 篇 网络空间安全
    • 19 篇 生物工程
    • 18 篇 材料科学与工程(可...
    • 14 篇 交通运输工程
    • 13 篇 仪器科学与技术
    • 11 篇 化学工程与技术
    • 11 篇 石油与天然气工程
    • 11 篇 安全科学与工程
  • 1,066 篇 理学
    • 957 篇 数学
    • 79 篇 统计学(可授理学、...
    • 61 篇 生物学
    • 51 篇 物理学
    • 27 篇 化学
    • 23 篇 系统科学
  • 191 篇 管理学
    • 142 篇 管理科学与工程(可...
    • 62 篇 图书情报与档案管...
    • 38 篇 工商管理
  • 36 篇 经济学
    • 35 篇 应用经济学
  • 33 篇 医学
    • 16 篇 临床医学
    • 11 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 9 篇 教育学
  • 8 篇 文学
  • 6 篇 农学
  • 1 篇 艺术学

主题

  • 2,948 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 96 篇 parallel algorit...
  • 65 篇 computational co...
  • 63 篇 graph theory
  • 58 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 49 篇 analysis of algo...
  • 46 篇 planar graphs
  • 44 篇 shortest paths
  • 44 篇 treewidth
  • 39 篇 social networks
  • 36 篇 data structures
  • 36 篇 distributed comp...
  • 33 篇 distributed algo...
  • 30 篇 complexity
  • 29 篇 parameterized al...
  • 29 篇 np-completeness
  • 26 篇 interval graphs

机构

  • 24 篇 univ bergen dept...
  • 19 篇 univ elect sci &...
  • 16 篇 ben gurion univ ...
  • 15 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 9 篇 univ vienna fac ...
  • 9 篇 technion israel ...
  • 9 篇 natl inst inform...
  • 9 篇 carnegie mellon ...
  • 9 篇 univ rostock ins...
  • 8 篇 indian inst tech...
  • 8 篇 simon fraser uni...
  • 8 篇 chinese univ hon...
  • 8 篇 swiss fed inst t...
  • 8 篇 carnegie mellon ...
  • 8 篇 tel aviv univ sc...
  • 8 篇 national univers...

作者

  • 31 篇 xiao mingyu
  • 23 篇 tsur dekel
  • 18 篇 saurabh saket
  • 17 篇 panda b. s.
  • 16 篇 fomin fedor v.
  • 13 篇 bader david a.
  • 13 篇 bodlaender hans ...
  • 13 篇 pandey arti
  • 13 篇 lokshtanov danie...
  • 12 篇 kratsch dieter
  • 11 篇 karthick t.
  • 11 篇 de figueiredo ce...
  • 11 篇 henzinger monika
  • 11 篇 bodlaender hl
  • 11 篇 nanongkai danupo...
  • 10 篇 mcmillan scott
  • 10 篇 dondi riccardo
  • 10 篇 nagamochi hirosh...
  • 10 篇 low tze meng
  • 10 篇 dragan feodor f.

语言

  • 2,328 篇 英文
  • 612 篇 其他
  • 8 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2948 条 记 录,以下是1731-1740 订阅
排序:
Exact algorithms for Kayles
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第C期562卷 165-176页
作者: Bodlaender, Hans L. Kratsch, Dieter Timmer, Sjoerd T. Univ Utrecht NL-3508 TB Utrecht Netherlands Univ Lorraine Metz LITA F-57045 Metz 01 France
In the game of KAYLES, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins... 详细信息
来源: 评论
COUNTING LIST MATRIX PARTITIONS OF graphS
收藏 引用
SIAM JOURNAL ON COMPUTING 2015年 第4期44卷 1089-1118页
作者: Goebel, Andreas Goldberg, Leslie Ann Mcquillan, Colin Richerby, David Yamakami, Tomoyuki Univ Oxford Dept Comp Sci Oxford OX1 3QD England Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England Univ Fukui Dept Informat Sci Fukui Fukui 9108507 Japan
Given a symmetric D x D matrix M over {0, 1, *}, a list M-partition of a graph G is a partition of the vertices of G into D parts which are associated with the rows of M. The part of each vertex is chosen from a given... 详细信息
来源: 评论
Fault tolerant additive and (μ, α)-spanners
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 580卷 94-100页
作者: Braunschvig, Gilad Chechik, Shiri Peleg, David Sealfon, Adam Weizmann Inst Sci Dept Comp Sci & Appl Math Rehovot Israel Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA
graph spanners are sparse subgraphs that preserve the distances of the original graph up to some approximation ratio (the spanner's stretch). A number of algorithms are known for constructing sparse spanners with ... 详细信息
来源: 评论
A greedy topology design to accelerate consensus in broadcast wireless sensor networks
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第3期115卷 408-413页
作者: Vecchio, Massimo Lopez-Valcarce, Roberto CREATE NET I-38123 Trento Italy Univ Vigo Dept Teoria Serial & Comunicac Vigo 36310 Spain
We present techniques to improve convergence speed of distributed average consensus algorithms in wireless sensor networks by means of topology design. A broadcast network is assumed, so that only the transmit power o... 详细信息
来源: 评论
An Improved Distributed Algorithm for Maximal Independent Set  16
An Improved Distributed Algorithm for Maximal Independent Se...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Mohsen Ghaffari MIT
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents a very simple randomized algorithm for this problem providing a near-optimal... 详细信息
来源: 评论
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第11期115卷 866-871页
作者: Moemke, Tobias Univ Saarland D-66123 Saarbrucken Germany
Given a complete edge-weighted graph G, we present a polynomial time algorithm to. compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weight of an optimal TSP solution of G. ... 详细信息
来源: 评论
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 573卷 26-42页
作者: Panda, B. S. Paul, S. Pradhan, D. Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India Indian Inst Technol Jodhpur 342011 Rajasthan India
A subset L subset of V of a graph G = (V, E) is called a liar's dominating set of G if (i) vertical bar N-G[u] boolean AND L vertical bar >= 2 for every vertex u is an element of V, and (ii) vertical bar N-G [u... 详细信息
来源: 评论
Vertex coloring edge-weighted digraphs
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第10期115卷 791-796页
作者: Bang-Jensen, Jorgen Halldorsson, Magnus M. Univ Southern Denmark Dept Math & Comp Sci Odense Denmark Reykjavik Univ Sch Comp Sci ICE TCS IS-101 Reykjavik Iceland
A coloring of a digraph with non-negative edge weights is a partition of the vertex set into independent sets, where a set is independent if the weighted in-degree of each node within the set is less than 1. We give c... 详细信息
来源: 评论
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 232-236页
作者: Janczewski, Robert Turowski, Krzysztof Gdansk Univ Technol Dept Algorithms & Syst Modelling Gdansk Poland
Given a graph G, a spanning subgraph H of G and an integer lambda >= 2, a lambda-backbone coloring of G with backbone H is a proper vertex coloring of G using colors 1,2,..., in which the color difference between v... 详细信息
来源: 评论
Responsive algorithms for Handling Load Surges and Switching Links On in Green Networks
Responsive Algorithms for Handling Load Surges and Switching...
收藏 引用
Ad-Hoc and Sensor Networks Symposium
作者: Radu CARPA Marcos Dias de ASSUNCAO Olivier GLUCK Laurent LEFEVRE Jean-Christophe MIGNOT Inria Avalon - LIP Laboratory - Ecole normale superieure of Lyon University of Lyon
Reducing the energy consumed by wired computer networks is a challenge that has been actively investigated over the past few years. A popular mechanism proposed to reduce the consumption aims to put links and line car... 详细信息
来源: 评论