咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是381-390 订阅
排序:
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2009年 第1期6卷 62-75页
作者: Willson, Stephen J. Iowa State Univ Dept Math Ames IA 50011 USA
Given a collection of rooted phylogenetic trees with overlapping sets of leaves, a compatible supertree S is a single tree whose set of leaves is the union of the input sets of leaves and such that S agrees with each ... 详细信息
来源: 评论
Stable sets in k-colorable P5-free graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第23-24期109卷 1235-1237页
作者: Maffray, Frederic CNRS Lab G SCOP Grenoble France
We show that, for fixed k, there is a polynomial-time algorithm that finds a maximum (or maximum-weight) stable set in any graph that belongs to the class of k-colorable P-5-free graphs, or, more generally. to the Cla... 详细信息
来源: 评论
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.
来源: 评论
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 ... 详细信息
来源: 评论
Query Structural Information of BPEL Processes
Query Structural Information of BPEL Processes
收藏 引用
4th International Conference on Internet and Web Applications and Services
作者: Ma, Zhilei Lu, Wei Leymann, Frank Univ Stuttgart Inst Architecture Applicat Syst D-70569 Stuttgart Germany
Reuse of proven process models increases modeling efficiency;and ensure the quality if process models. To provide a better support for reuse, the retrieval mechanisms of process repositories should be able to propose ... 详细信息
来源: 评论
Minimum spanning trees
收藏 引用
Involve 2009年 第4期2卷 439-450页
作者: Jayawant, Pallavi Glavin, Kerry Department of Mathematics Bates College Lewiston 04240 ME United States
The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired ... 详细信息
来源: 评论
An O(n1.75) algorithm for L(2,1)-labeling of trees
收藏 引用
11th Scandinavian Workshop on algorithm Theory (SWAT 2008)
作者: Hasunuma, Toru Ishii, Toshimasa Ono, Hirotaka Uno, Yushi Kyushu Univ Dept Comp Sci & Commun Engn Fukuoka 8128581 Japan Univ Tokushima Dept Math & Nat Sci Tokushima 7708502 Japan Otaru Univ Dept Informat & Management Sci Otaru Hokkaido 0478501 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)] >= 2 if x and y are adjacent and [f (x) - f (y)] >= 1 if x and y are at d... 详细信息
来源: 评论
Augmenting edge-connectivity between vertex subsets  09
Augmenting edge-connectivity between vertex subsets
收藏 引用
Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
作者: Toshimasa Ishii Kazuhisa Makino Otaru University of Commerce Otaru Japan University of Tokyo Tokyo Japan
Given a graph G = (V, E) and a requirement function r: W1 x W2 → R+ for two families W1, W2 ⊆ 2V - {θ}, we consider the problem (called area-to-area edge-connectivity augmentation problem) of augmenting G by a small... 详细信息
来源: 评论
Closest 4-leaf power is fixed-parameter tractable
收藏 引用
DISCRETE APPLIED MATHEMATICS 2008年 第18期156卷 3345-3361页
作者: Dom, Michael Guo, Jiong Hueffner, Falk Niedermeier, Rolf Univ Jena Inst Informat D-07743 Jena Germany
The NP-complete CLOSEST 4-LEAF POWER problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph... 详细信息
来源: 评论
An improved approximation algorithm for capacitated multicast routings in networks
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1期390卷 81-91页
作者: Morsy, Ehab Nagamochi, Hiroshi Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
Let G = (V, E) be a connected graph such that each edge e is an element of E is weighted by nonnegative real w(e). Let s be a vertex designated as a source, k be a positive integer, and S subset of V be a set of termi... 详细信息
来源: 评论