咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是211-220 订阅
排序:
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2017年 第PartA期657卷 86-97页
作者: Xiao, Mingyu Kou, Shaowei Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China
A dissociation set in a graph G = (V, E) is a vertex subset D such that the subgraph G[D] induced on D has vertex degree at most 1. A 3-path vertex cover in a graph is a vertex subset C such that every path of three v... 详细信息
来源: 评论
algorithmic aspects of open neighborhood location-domination in graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 第Part1期216卷 290-306页
作者: Panda, B. S. Pandey, Arti Indian Inst Technol Delhi Dept Math New Delhi 110016 India
A set D subset of V of a graph G = (V, E) is called an open neighborhood locating-dominating set (OLD-set) if (i)N-G(v) boolean AND D not equal empty set for all v is an element of V, and (ii)N-G(u) boolean AND D not ... 详细信息
来源: 评论
Alliances in graphs of bounded clique-width
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 223卷 91-97页
作者: Kiyomi, Masashi Otachi, Yota Yokohama City Univ Int Coll Arts & Sci Kanazawa Ku 22-2 Seto Yokohama Kanagawa 2360027 Japan Japan Adv Inst Sci & Technol Sch Informat Sci Asahidai 1-1 Nomi Ishikawa 9231292 Japan
An alliance in a graph is a set of vertices that is either safe under attacks from the neighborhood (defensive), capable of attacking its neighbors (offensive), or simultaneously defensive and offensive (powerful). An... 详细信息
来源: 评论
The Maximum Labeled Path Problem
收藏 引用
algorithmICA 2017年 第1期78卷 298-318页
作者: Couetoux, Basile Nakache, Elie Vaxes, Yann Aix Marseille Univ CNRS LIF UMR 7279 F-13288 Marseille France
In this paper, we study the approximability of the Maximum Labeled Path problem: given a vertex-labeled directed acyclic graph D, find a path in D that collects a maximum number of distinct labels. For any epsilon >... 详细信息
来源: 评论
Robustness of First- and Second-Order Consensus algorithms for a Noisy Scale-Free Small-World Koch Network
收藏 引用
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2017年 第1期25卷 342-350页
作者: Yi, Yuhao Zhang, Zhongzhi Shan, Liren Chen, Guanrong Fudan Univ Sch Comp Sci Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China
In this brief, we study first- and second-order consensus algorithms for the scale-free small-world Koch network, where vertices are subject to white noise. We focus on three cases of consensus schemes: 1) first-order... 详细信息
来源: 评论
On the minimum routing cost clustered tree problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年 第3期33卷 1106-1121页
作者: Lin, Chen-Wan Wu, Bang Ye Natl Chung Cheng Univ Chiayi 621 Taiwan
For an edge-weighted graph , in which the vertices are partitioned into k clusters , a spanning tree T of G is a clustered spanning tree if T can be cut into k subtrees by removing edges such that each subtree is a sp... 详细信息
来源: 评论
IPED2: Inheritance Path Based Pedigree Reconstruction algorithm for Complicated Pedigrees
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2017年 第5期14卷 1094-1103页
作者: He, Dan Wang, Zhanyong Parida, Laxmi Eskin, Eleazar IBM Corp Thomas J Watson Res Yorktown Hts NY 10598 USA Univ Calif Los Angeles Los Angeles CA 90095 USA
Reconstruction of family trees, or pedigree reconstruction, for a group of individuals is a fundamental problem in genetics. The problem is known to be NP-hard even for datasets known to only contain siblings. Some re... 详细信息
来源: 评论
Narrow sieves for parameterized paths and packings
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2017年 87卷 119-139页
作者: Bjorklund, Andreas Husfeldt, Thore Kaski, Petteri Koivisto, Mikko Lund Univ Dept Comp Sci POB 118 SE-22100 Lund Sweden IT Univ Copenhagen DK-2300 Copenhagen Denmark Aalto Univ Dept Informat & Comp Sci HIIT POB 15400 FI-00076 Aalto Finland Univ Helsinki HIIT Dept Comp Sci POB 68 FI-00014 Helsinki Finland
We present parameterized algorithms for the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in time exponential only... 详细信息
来源: 评论
Computational methods to identify metabolic sub-networks based on metabolomic profiles
收藏 引用
BRIEFINGS IN BIOINFORMATICS 2017年 第1期18卷 43-56页
作者: Frainay, Clement Jourdan, Fabien Toulouse Univ INRA INP Res Ctr Food ToxicolUMR 1331 180 Chemin Tournefeuille F-31027 Toulouse France
Untargeted metabolomics makes it possible to identify compounds that undergo significant changes in concentration in different experimental conditions. The resulting metabolomic profile characterizes the perturbation ... 详细信息
来源: 评论
An algorithm for Motif-Based Network Design
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2017年 第5期14卷 1181-1186页
作者: Maki-Marttunen, Tuomo Tampere Univ Technol Dept Signal Proc Tampere 33720 Finland Univ Oslo Inst Clin Med N-0316 Oslo Norway
A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoti... 详细信息
来源: 评论