咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是341-350 订阅
排序:
On the complexity of reconfiguration problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第12-14期412卷 1054-1065页
作者: Ito, Takehiro Demaine, Erik D. Harvey, Nicholas J. A. Papadimitriou, Christos H. Sideri, Martha Uehara, Ryuhei Uno, Yushi Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Univ Calif Berkeley Div Comp Sci Dept EECS Berkeley CA 94720 USA Athens Univ Econ & Business Dept Comp Sci Athens 10434 Greece JAIST Sch Informat Sci Nomi Ishikawa 9231292 Japan Osaka Prefecture Univ Grad Sch Sci Naka Ku Sakai Osaka 5998531 Japan
Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. We demonstrate that a host of reconfi... 详细信息
来源: 评论
Linear-time algorithm for the matched-domination problem in cographs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2011年 第10期88卷 2042-2056页
作者: Hung, Ruo-Wei Yao, Chih-Chia Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung 41349 Taiwan
Let G = (V, E) be a graph without isolated vertices. A matching in G is a set of independent edges in G. A perfect matching M in G is a matching such that every vertex of G is incident to an edge of M. A set S subset ... 详细信息
来源: 评论
PARAMETERIZED COMPLEXITY OF ARC-WEIGHTED DIRECTED STEINER PROBLEMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2011年 第2期25卷 583-599页
作者: Guo, Jiong Niedermeier, Rolf Suchy, Ondrej Univ Saarland D-66123 Saarbrucken Germany TU Berlin Inst Softwaretech & Theoret Informat D-10587 Berlin Germany Charles Univ Prague Dept Appl Math KAM CR-11800 Prague Czech Republic Charles Univ Prague Inst Theoret Comp Sci ITI CR-11800 Prague Czech Republic
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: directed Steiner tree, strongly connected Steiner subgraph, and directed Ste... 详细信息
来源: 评论
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar graphs
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年 第2期E94D卷 211-219页
作者: Zhuang, Bingbing Nagamochi, Hiroshi Kyoto Univ Dept Appl Math & Phys Grad Sch Informat Kyoto 6068501 Japan
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerp... 详细信息
来源: 评论
On acyclic edge coloring of toroidal graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2011年 第13期111卷 647-649页
作者: Xu, Yian Nanjing Normal Univ Sch Math Sci Nanjing 210046 Peoples R China
Let c be a proper edge coloring of a graph G. If there exists no bicolored cycle in G with respect to c, then c is called an acyclic edge coloring of G. Let G be a planar graph with maximum degree Delta and girth g. I... 详细信息
来源: 评论
Maximum bipartite flow in networks with adaptive channel width
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第24期412卷 2577-2587页
作者: Azar, Yossi Madry, Aleksander Moscibroda, Thomas Panigrahi, Debmalya Srinivasan, Aravind MIT Comp Sci & Artificial Intelligence Lab Stata Ctr Cambridge MA 02139 USA Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA Microsoft Res Redmond WA 98052 USA
Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the... 详细信息
来源: 评论
AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2011年 第5期22卷 1211-1227页
作者: Mizuki, Takaaki Nakayama, Satoru Sone, Hideaki Tohoku Univ Cybersci Ctr Aoba Ku Sendai Miyagi 9808578 Japan Tohoku Univ Grad Sch Informat Sci Sone Lab Aoba Ku Sendai Miyagi 9808578 Japan
Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We regard each player as a vertex of a graph and regard each pair of players sharing a key as a... 详细信息
来源: 评论
GreedyMAX-type algorithms for the Maximum Independent Set Problem
GreedyMAX-type Algorithms for the Maximum Independent Set Pr...
收藏 引用
37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011
作者: Borowiecki, Piotr Goering, Frank Gdansk Univ Technol Dept Algorithms & Syst Modeling Fac Elect Telecommun & Informat Narutowicza 11-12 PL-80233 Gdansk Poland Fak Math D-09107 Chemnitz Germany
A maximum independent set problem for a simple graph G = (V, E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this articl... 详细信息
来源: 评论
Maximum bipartite flow in networks with adaptive channel width
Maximum bipartite flow in networks with adaptive channel wid...
收藏 引用
36th International Colloquium on Automata, Languages and Programming
作者: Azar, Yossi Madry, Aleksander Moscibroda, Thomas Panigrahi, Debmalya Srinivasan, Aravind MIT Comp Sci & Artificial Intelligence Lab Stata Ctr Cambridge MA 02139 USA Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA Microsoft Res Redmond WA 98052 USA
Traditionally, network optimization problems assume that each link in the network has a fixed capacity. Recent research in wireless networking has shown that it is possible to design networks where the capacity of the... 详细信息
来源: 评论
A novel method for deployment of distributed network monitors
A novel method for deployment of distributed network monitor...
收藏 引用
4th International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2011
作者: Ou, Peng Li, Zhishu Lin, Xun School of Computer Science Sichuan University Chengdu China School of Economic Information Engineering Southwest University of Finance and Economy Chengdu China
The requirement of increasing the deployment of a distributed monitoring system as the network expanding is becoming a new research focus. The problem is where to put those monitors and by how much to put. This paper ... 详细信息
来源: 评论