咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是161-170 订阅
排序:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 770卷 69-78页
作者: Le, Hoang-Oanh Le, Van Bang Univ Rostock Inst Informat Rostock Germany
In a graph, a matching cut is an edge cut that is a matching. MATCHING CUT is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP complete even when restricted to bipartite... 详细信息
来源: 评论
algorithmic aspects of semitotal domination in graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 766卷 46-57页
作者: Henning, Michael A. Pandey, Arti Univ Johannesburg Dept Pure & Appl Math Auckland Pk ZA-2006 Johannesburg South Africa Indian Inst Technol Ropar Dept Math Nangal Rd Rupnagar 140001 Punjab India
For a graph G = (V, E), a set D subset of V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The MINIMUM SEMITOTAL DOMINATION ... 详细信息
来源: 评论
A heuristic approach for searching (d, n)-packing colorings of infinite lattices
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 257卷 353-358页
作者: Korze, Danilo Markus, Ziga Vesel, Aleksander Univ Maribor Fac Elect Engn & Comp Sci Koroska Cesta 46 SI-2000 Maribor Slovenia Univ Maribor Fac Nat Sci & Math Koroska Cesta 160 SI-2000 Maribor Slovenia
A (d, n)-packing k-coloring of a graph G for integers d and n is a mapping from V(G) to the set {1, 2, ..., k} such that vertices with color i is an element of {1, 2, ..., k} have pairwise distance greater than d + le... 详细信息
来源: 评论
Reconfiguration of colorable sets in classes of perfect graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 772卷 111-122页
作者: Ito, Takehiro Otachi, Yota Tohoku Univ Grad Sch Informat Sci Aoba Yama 6-6-05 Sendai Miyagi 9808579 Japan Kumamoto Univ Fac Adv Sci & Technol Chuo Ku 2-39-1 Kurokami Kumamoto 8608555 Japan
A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (called a reconfiguration sequence) ... 详细信息
来源: 评论
Secure domination in cographs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2019年 262卷 179-184页
作者: Araki, Toru Yamanaka, Ryo Gunma Univ Div Elect & Informat Kiryu Gunma 3768515 Japan
A subset S of vertices in a graph G is a secure dominating set of G if S is a dominating set of G and, for each vertex u is not an element of S, there is a vertex v is an element of S such that uv is an edge and (S \ ... 详细信息
来源: 评论
Traversal with Enumeration of Geometric graphs in Bounded Space
收藏 引用
JOURNAL OF INTERCONNECTION NETWORKS 2019年 第4期19卷
作者: Khakabimamaghani, Sahand Masjoody, Masood Stacho, Ladislav Simon Fraser Univ Dept Comp Sci 8888 Univ Dr Burnaby BC V5A 1S6 Canada Simon Fraser Univ Dept Math 8888 Univ Dr Burnaby BC V5A 1S6 Canada
In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph G with the integer l... 详细信息
来源: 评论
Safe sets in graphs: graph classes and structural parameters
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2018年 第4期36卷 1221-1242页
作者: Agueda, Raquel Cohen, Nathann Fujita, Shinya Legay, Sylvain Manoussakis, Yannis Matsui, Yasuko Montero, Leandro Naserasr, Reza Ono, Hirotaka Otachi, Yota Sakuma, Tadashi Tuza, Zsolt Xu, Renyu Univ Castilla La Mancha Ciudad Real Spain Univ Paris Sud LRI Orsay France Yokohama City Univ Yokohama Kanagawa Japan Tokai Univ Tokyo Japan Univ Paris Diderot LIAFA Paris France Nagoya Univ Nagoya Aichi Japan Kumamoto Univ Kumamoto Japan Yamagata Univ Yamagata Japan MTA Renyi Inst Budapest Hungary Univ Pannonia Veszprem Hungary Shandong Univ Jinan Shandong Peoples R China
A safe set of a graph is a non-empty subset S of V such that for every component A of G[S] and every component B of , we have whenever there exists an edge of G between A and B. In this paper, we show that a minimum s... 详细信息
来源: 评论
Efficient Dispersion of Mobile Robots on graphs  19
Efficient Dispersion of Mobile Robots on Graphs
收藏 引用
20th International Conference on Distributed Computing and Networking (ICDCN)
作者: Kshemkalyani, Ajay D. Ali, Faizan Univ Illinois Chicago IL 60612 USA
The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k <= n, to coordinate with each other to reach a final configuration in which each robot is at a dis... 详细信息
来源: 评论
Optimal Partition of a Tree with Social Distance  13th
Optimal Partition of a Tree with Social Distance
收藏 引用
13th International Conference on algorithms and Computation (WALCOM)
作者: Okubo, Masahiro Hanaka, Tesshu Ono, Hirotaka Nagoya Univ Grad Sch Informat Chikusa Ku Furo Cho Nagoya Aichi Japan Chuo Univ Dept Informat & Syst Engn Bunkyo Ku 1-13-27 Kasuga Tokyo Japan
We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first ... 详细信息
来源: 评论
A survey of graph processing on graphics processing units
收藏 引用
JOURNAL OF SUPERCOMPUTING 2018年 第5期74卷 2086-2115页
作者: Ha-Nguyen Tran Cambria, Erik Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore
graphics processing units (GPUs) have become popular high-performance computing platforms for a wide range of applications. The trend of processing graph structures on modern GPUs has also attracted an increasing inte... 详细信息
来源: 评论