咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是411-420 订阅
排序:
Minimum edge ranking spanning trees of split graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第16期154卷 2373-2386页
作者: Makino, Kazuhisa Uno, Yushi Ibaraki, Toshihide Osaka Prefecture Univ Grad Sch Sci Dept Math & Informat Sci Sakai Osaka 5998531 Japan Univ Tokyo Grad Sch Informat & Technol Dept Math Informat Tokyo 1138656 Japan Kwansei Gakuin Univ Sch Sci & Technol Dept Informat Sanda 6691337 Japan
Given a graph G, the minimum edge ranking spanning tree problem (MERST) is to find a spanning tree of G whose edge ranking is minimum. However, this problem is known to be NP-hard for general graphs. In this paper, we... 详细信息
来源: 评论
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2006年 第8期72卷 1386-1396页
作者: Guo, Jiong Gramm, Jens Hueffner, Falk Niedermeier, Rolf Wernicke, Sebastian Univ Jena Inst Informat D-07743 Jena Germany Univ Tubingen Wilhelm Schickard Inst Informat D-72076 Tubingen Germany
We show that the NP-complete FEEDBACK VERTEX SET problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(c(k) center dot m) time. Here, in ... 详细信息
来源: 评论
Computing bounded-degree phylogenetic roots of disconnected graphs
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2006年 第2期59卷 125-148页
作者: Chen, Zhi-Zhong Tsukiji, Tatsuie Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan Tokyo Denki Univ Dept Informat Sci Hatoyama Saitama 3500394 Japan
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e., leaves) of T are ex... 详细信息
来源: 评论
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
收藏 引用
COMPUTER-AIDED DESIGN 2006年 第1期38卷 1-13页
作者: Gao, XS Lin, Q Zhang, GF Acad Sinica AMSS Inst Syst Sci Key Lab Math Mechanizat Beijing 100080 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which ar... 详细信息
来源: 评论
A study on the locality behavior of minimum spanning tree algorithms
收藏 引用
13th International Conference on High Performance Computing (HiPC 2006)
作者: Cong, Guojing Sbaraglia, Simone IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
Locality behavior study is crucial for achieving good performance for irregular problems. graph algorithms with large, sparse inputs, for example, often times achieve only a tiny fraction of the potential peak perform... 详细信息
来源: 评论
Directed convergence heuristic: A fast & novel approach to Steiner tree construction
Directed convergence heuristic: A fast & novel approach to S...
收藏 引用
International Conference on Very Large Scale Integration and System-on-Chip
作者: Chakraverty, Shampa Batra, Arvind Rathi, Aman Univ Delhi Dept Comp Engn Netaji Subhas Inst Technol New Delhi 110075 India
One of the fundamental problems encountered during the VLSI design flow is to find minimum length nets that connect specific nodes on the chip. The challenge lies in finding an efficient solution to the Steiner tree P... 详细信息
来源: 评论
A completely dynamic algorithm for split graphs
收藏 引用
Electronic Notes in Discrete Mathematics 2006年 27卷 69-70页
作者: Mancini, Federico Heggernes, Pinar Informatics University of Bergen Bergen Norway Informatics University of Bergen Bergen Norway
来源: 评论
Computing bounded-degree phylogenetic roots of disconnected graphs
收藏 引用
30th International Workshop on graph-Theoretic Concepts in Computer Science
作者: Chen, Zhi-Zhong Tsukiji, Tatsuie Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan Tokyo Denki Univ Dept Informat Sci Hatoyama Saitama 3500394 Japan
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e., leaves) of T are ex... 详细信息
来源: 评论
最小全一问题的解及其算法的研究
最小全一问题的解及其算法的研究
收藏 引用
作者: 张晓岩 南开大学
学位级别:博士
细胞自动机是一种离散动力系统。它包含了由细胞单元的状态构成的配制以及作用在配制上的传递规则。下面我们总是假设G=(V,E)是一个有限无向的简单连通图。图上的每一个顶点可以看作细胞自动机上的一个细胞单元,细胞单元上状态的值... 详细信息
来源: 评论
Balanced vertex-orderings of graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2005年 第1期148卷 27-48页
作者: Biedl, T Chan, T Ganjali, Y Hajiaghayi, MT Wood, DR Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada Stanford Univ Dept Elect Engn Stanford CA 94305 USA MIT Comp Sci Lab Cambridge MA 02139 USA Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph;, that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This prob... 详细信息
来源: 评论