咨询与建议

限定检索结果

文献类型

  • 363 篇 期刊文献
  • 145 篇 会议
  • 7 篇 学位论文

馆藏范围

  • 515 篇 电子文献
  • 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 篇 农学

主题

  • 515 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 15 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 12 篇 shortest path
  • 11 篇 minimum spanning...
  • 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

语言

  • 456 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
515 条 记 录,以下是391-400 订阅
排序:
Minimal cutwidth linear arrangements of abelian Cayley graphs
收藏 引用
DISCRETE MATHEMATICS 2008年 第20期308卷 4670-4695页
作者: Berend, Daniel Korach, Ephraim Lipets, Vladimir Ben Gurion Univ Negev Dept Math IL-84105 Beer Sheva Israel Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel Ben Gurion Univ Negev Dept Ind Engn & Management IL-84105 Beer Sheva Israel
We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each orde... 详细信息
来源: 评论
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction algorithm
收藏 引用
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2008年 第12期27卷 2169-2182页
作者: Long, Jieyi Zhou, Hai Memik, Seda Ogrenci Northwestern Univ Dept Elect Engn & Comp Engn Evanston IL 60208 USA
Obstacle-avoiding Steiner routing has arisen as a fundamental problem in the physical design of modern VLSI chips. In this paper, we present EBOARST, an efficient four-step algorithm to construct a rectilinear obstacl... 详细信息
来源: 评论
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction algorithm
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectiline...
收藏 引用
International Symposium on Physical Design (ISPD)
作者: Long, Jieyi Zhou, Hai Memik, Seda Ogrenci Northwestern Univ Dept Elect Engn & Comp Engn Evanston IL 60208 USA
Obstacle-avoiding Steiner routing has arisen as a fundamental problem in the physical design of modern VLSI chips. In this paper, we present EBOARST, an efficient four-step algorithm to construct a rectilinear obstacl... 详细信息
来源: 评论
Efficient algorithms for Variants of Weighted Matching and Assignment Problems
收藏 引用
MATHEMATICS IN COMPUTER SCIENCE 2008年 第4期1卷 673-688页
作者: Banerjee, Satyajit Chowdhury, Atish Datta Ghosh, Subhas Kumar Honeywell Technol Solut 151-1 DoraisanipalyaBannerghatta Rd Bangalore 560076 Karnataka India
Obtaining a matching in a graph satisfying a certain objective is an important class of graph problems. Matching algorithms have received attention for several decades. However, while there are efficient algorithms to... 详细信息
来源: 评论
An Improved Divide-and-Conquer algorithm for Finding All Minimum k-Way Cuts
收藏 引用
19th International Symposium on algorithms and Computations (ISAAC 2008)
作者: Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci arid Engn Chengdu 610054 Peoples R China
Given a positive integer k and an edge-weighted undirected graph G = (V, E;w), the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connected comp... 详细信息
来源: 评论
algorithms for multiterminal cuts
收藏 引用
3rd International Computer Science Symposium
作者: Xiao, Mingyu Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China
Given a graph G = (V, E) with n vertices and m edges, and a subset T of 1 vertices called terminals, the Edge (respectively, Vertex) Multiterminal Cut problem is to find a set of k edges (non-terminal vertices), whose... 详细信息
来源: 评论
Combined Segmentation and Visual Attention for Object Categorization and Video Semantic Concepts Detection
Combined Segmentation and Visual Attention for Object Catego...
收藏 引用
3rd International Conference on Pervasive Computing and Applications
作者: Tan, Li Cao, Yuanda Yang, Minghua He, Qiaoyan Beijing Inst Technol Beijing Lab Intelligent Informat Technol Sch Comp Sci Beijing Peoples R China
Recent researches show that the benefits of image segmentation have been exploited in object categorization and recognition approaches. In most of these works, objects are segmented from the background around to incre... 详细信息
来源: 评论
A General Tractable Density Concept for graphs
收藏 引用
MATHEMATICS IN COMPUTER SCIENCE 2008年 第4期1卷 689-699页
作者: Farago, Andras Univ Texas Dallas Dept Comp Sci POB 830688 Richardson TX 75083 USA
In many applications it is an important algorithmic task to find a densest subgraph in an input graph. The complexity of this task depends on how density is defined. If density means the ratio of the number of edges a... 详细信息
来源: 评论
Complexity of the Packing Coloring Problem for Trees
Complexity of the Packing Coloring Problem for Trees
收藏 引用
34th International Workshop on graph-Theoretic Concepts in Computer Science
作者: Fiala, Jiri Golovach, Petr A. Charles Univ Prague Dept Appl Math CR-11800 Prague Czech Republic Univ Bergen Dept Informat N-5020 Bergen Norway
Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise distance greater than i. We solve an open problem of Goddard et al. and show that the dec... 详细信息
来源: 评论
Realization of two graph algorithms and design of the operational platform of graph algorithms
收藏 引用
Yi Qi Yi Biao Xue Bao/Chinese Journal of Scientific Instrument 2007年 第SUPP. 4期28卷 378-380+387页
作者: Wu, Jun Liu, Xiulan College of Electronic Information and Control Engineering Beijing University of Technology Beijing 100022 China
Two graph algorithms which derive from bread-first search were implemented by using C language in this paper. One algorithm is a replacement method for finding out a graph's all spanning tree, the other is the Pat... 详细信息
来源: 评论