咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是271-280 订阅
排序:
algorithmic Aspects of Disjunctive Domination in graphs  21st
Algorithmic Aspects of Disjunctive Domination in Graphs
收藏 引用
21st International Computing and Combinatorics Conference (COCOON)
作者: Panda, B. S. Pandey, Arti Paul, S. Indian Inst Technol Delhi Hauz Khas Dept Math New Delhi 110016 India Indian Stat Inst Adv Comp & Microelect Kolkata 700108 India
For a graph G = (V, E), a set D subset of V is called a disjunctive dominating set of G if for every vertex v is an element of V \ D, v is either adjacent to a vertex of D or has at least two vertices in D at distance... 详细信息
来源: 评论
Reconfiguration of list L(2,1)-labelings in a graph
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第C期544卷 84-97页
作者: Ito, Takehiro Kawamura, Kazuto Ono, Hirotaka Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Kyushu Univ Fac Econ Higashi Ku Fukuoka 8128581 Japan
For an integer k >= 0, suppose that each vertex v of a graph G has a set C(v) subset of {0, 1,..., k} of labels, called a list of v. A list L(2, 1)-labeling of G is an assignment of a label in C(v) to each vertex v... 详细信息
来源: 评论
A novel method to find out sensory neuron tracts in the Drosophila brain
收藏 引用
BMC Neuroscience 2015年 第1期16卷 1-2页
作者: Chao-Chun Chuang National Center for High-Performance Computing Taiwan Republic of China
来源: 评论
Improving graph-Based Image Segmentation Using Automatic Programming  17
收藏 引用
17th European Conference on Applications of Evolutionary Computation (EvpApplications)
作者: Magnusson, Lars Vidar Olsson, Roland Ostfold Univ Coll IT Dept Halden Norway
This paper investigates how Felzenszwalb's and Huttenlocher's graph-based segmentation algorithm can be improved by automatic programming. We show that computers running Automatic Design of algorithms Through ... 详细信息
来源: 评论
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2014年 第3期E97D卷 421-430页
作者: Wasa, Kunihiro Kaneta, Yusaku Uno, Takeaki Arimura, Hiroki Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Hokkaido 0600814 Japan Natl Inst Informat Tokyo 1018430 Japan
By the motivation to discover patterns in massive structured data in the form of graphs and trees, we study a special case of the k-subtree enumeration problem with a tree of n nodes as an input graph, which is origin... 详细信息
来源: 评论
Finding k Shortest Simple Paths in Directed graphs: A Node Classification algorithm
收藏 引用
NETWORKS 2014年 第1期64卷 6-17页
作者: Feng, Gang Univ Wisconsin Dept Elect Engn Platteville WI 53818 USA
We propose a new exact algorithm for enumerating k shortest simple paths in a directed graph with n nodes and m edges. The algorithm has a complexity of O(kn(m + n log n)) and follows the same process as Yen's dev... 详细信息
来源: 评论
Remarks on the Complexity of Signed k-Domination on graphs
Remarks on the Complexity of Signed k-Domination on Graphs
收藏 引用
2015 Workshop 1
作者: Chuan-Min Lee Cheng-Chien Lo Rui-Xin Ye Xun Xu Xiao-Han Shi Jia-Ying Li Department of Computer and Communication Engineering Ming Chuan University The First American University in Asia Department of Electronic Information Engineering Fuzhou University
This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is ... 详细信息
来源: 评论
On the weighted k-path vertex cover problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2014年 177卷 14-18页
作者: Bresar, B. Krivos-Bellus, R. Semanisin, G. Sparl, P. Pavol Jozef Safarik Univ Kosice Fac Sci Inst Comp Sci Jesenna 5 Kosice 04001 Slovakia Univ Maribor Fac Nat Sci & Math SI-2000 Maribor Slovenia Univ Maribor Fac Org Sci SI-4000 Kranj Slovenia Inst Math Phys & Mech Ljubljana 1000 Slovenia
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is called the k-path vertex cover... 详细信息
来源: 评论
Improving Space Efficiency With Path Length Prediction for Finding k Shortest Simple Paths
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 2014年 第10期63卷 2459-2472页
作者: Feng, Gang Univ Wisconsin Dept Elect Engn Platteville WI 53818 USA
Finding k shortest simple paths in a directed graph is a fundamental problem in many engineering applications. Most existing algorithms such as Yen's algorithm and its variants have polynomial worst-case time comp... 详细信息
来源: 评论
Parallel Subgraph Listing in a Large-Scale graph  14
Parallel Subgraph Listing in a Large-Scale Graph
收藏 引用
ACM SIGMOD International Conference on Management of Data
作者: Shao, Yingxia Cui, Bin Chen, Lei Ma, Lin Yao, Junjie Xu, Ning Peking Univ Sch EECS Key Lab High Confidence Software Technol MOE Beijing Peoples R China HKUST Dept Comp Sci & Engn Hong Kong Peoples R China
Subgraph listing is a fundamental operation to many graph and network analyses. The problem itself is computationally expensive and is well-studied in centralized processing algorithms. However, the centralized soluti... 详细信息
来源: 评论