咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是61-70 订阅
排序:
The perfect matching cut problem revisited
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 931卷 117-130页
作者: Le, Van Bang Telle, Jan Arne Univ Rostock Inst Informat Rostock Germany Univ Bergen Dept Informat N-5020 Bergen Norway
In a graph, a perfect matching cut is an edge cut that is a perfect matching. PERFECT MATCHING CUT (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We ... 详细信息
来源: 评论
Optimal algorithm for Finding Representation of Subtree Distance
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2022年 第8期E105卷 1203-1210页
作者: Maehara, Takanori Ando, Kazutoshi RIKEN Ctr Adv Intelligence Project Discrete Optimizat Unit Tokyo Japan Shizuoka Univ Dept Math & Syst Engn Shizuoka Japan
In this paper, we address the problem of finding a representation of a subtree distance, which is an extension of a tree metric. We show that a minimal representation is uniquely determined by a given subtree distance... 详细信息
来源: 评论
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules  1
收藏 引用
18th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Domon, Naoki Suzuki, Akira Tamura, Yuma Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi Japan
The shortest path problem is the most classical and fundamental problem in the field of graph algorithm. Recently, its reconfiguration variant, namely the Shortest Path Reconfiguration problem, has received a lot of a... 详细信息
来源: 评论
Extension of Parallel Primitives and Their Applications to Large-Scale Data Processing  35th
Extension of Parallel Primitives and Their Applications to L...
收藏 引用
35th International Conference on Database and Expert Systems Applications (DEXA)
作者: Nakano, Masashi Chang, Qiong Miyazaki, Jun Tokyo Inst Technol Sch Comp Dept Comp Sci Tokyo Japan
Data parallel primitives are highly optimized general-purpose algorithms designed only for GPUs and are used as building blocks to develop applications. However, existing data parallel primitives cannot handle data la... 详细信息
来源: 评论
Shortest Two Disjoint Paths in Conservative graphs  41
Shortest Two Disjoint Paths in Conservative Graphs
收藏 引用
41st International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Schlotter, Ildiko Ctr Econ & Reg Studies Budapest Hungary Budapest Univ Technol & Econ Budapest Hungary
We consider the following problem that we call the Shortest Two Disjoint Paths problem: given an undirected graph G = ( V, E) with edge weights w : E -> R, two terminals s and t in G, find two internally vertex-dis... 详细信息
来源: 评论
Ontology Reshaping for Knowledge graph Construction: Applied on Bosch Welding Case  21st
Ontology Reshaping for Knowledge Graph Construction: Applied...
收藏 引用
21st International Semantic Web Conference (ISWC)
作者: Zhou, Dongzhuoran Zhou, Baifan Zheng, Zhuoxun Soylu, Ahmet Cheng, Gong Jimenez-Ruiz, Ernesto Kostylev, Egor V. Kharlamov, Evgeny Bosch Ctr Artificial Intelligence Renningen Germany Univ Oslo Dept Informat Oslo Norway Oslo Metropolitan Univ Dept Comp Sci Oslo Norway Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China City Univ London Dept Comp Sci London England
Automatic knowledge graph (KG) construction is widely used in industry for data integration and access, and there are several approaches to enable (semi-)automatic construction of knowledge graphs. One important appro... 详细信息
来源: 评论
Improved approximation for maximum edge colouring problem
收藏 引用
DISCRETE APPLIED MATHEMATICS 2022年 319卷 42-52页
作者: Chandran, L. Sunil Lahiri, Abhiruk Singh, Nitin Indian Inst Sci Dept Comp Sci & Automat Bangalore India IBM India Res Lab Bangalore India
The anti-Ramsey number, ar(G, H) is the minimum integer k such that in any edge colouring of G with k colours there is a rainbow subgraph isomorphic to H, namely, a copy of H with each of its edges assigned a differen... 详细信息
来源: 评论
On the decomposition of circulant graphs using algorithmic approaches
收藏 引用
ALEXANDRIA ENGINEERING JOURNAL 2022年 第10期61卷 8263-8275页
作者: El-Mesady, A. Hamed, Y. S. Shabana, H. Menoufia Univ Fac Elect Engn Dept Phys & Engn Math Menoufia 32952 Egypt Taif Univ Coll Sci Dept Math & Stat POB 11099 Taif 21944 Saudi Arabia
Many structural models in chemistry, biology, computer science, sociology, and operations research can be analyzed using graph theory. Some examples of these structure models are species movement between regions, mole... 详细信息
来源: 评论
Solving String Problems on graphs Using the Labeled Direct Product
收藏 引用
algorithmICA 2022年 第10期84卷 3008-3033页
作者: Rizzo, Nicola Tomescu, Alexandru, I Policriti, Alberto Univ Helsinki Dept Comp Sci Helsinki Finland Univ Udine Dept Math Comp Sci & Phys Udine Italy
Suffix trees are an important data structure at the core of optimal solutions to many fundamental string problems, such as exact pattern matching, longest common substring, matching statistics, and longest repeated su... 详细信息
来源: 评论
Connected Feedback Vertex Set on AT-Free graphs  34th
Connected Feedback Vertex Set on AT-Free Graphs
收藏 引用
34th International Workshop on Combinatorial algorithms (IWOCA)
作者: Mukherjee, Joydeep Saha, Tamojit Ramakrishna Mission Vivekananda Educ & Res Inst Howrah India TCG CREST Inst Adv Intelligence Kolkata India
A connected feedback vertex set of a graph is a connected subgraph of the graph whose removal makes the graph cycle free. In this paper, we give an approximation algorithm that computes a connected feedback vertex set... 详细信息
来源: 评论