咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是181-190 订阅
排序:
Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs  1
收藏 引用
Conference on Analysis of Experimental algorithms (SEA2)
作者: Kawahara, Jun Saitoh, Toshiki Suzuki, Hirofumi Yoshinaka, Ryo Nara Inst Sci & Technol Ikoma Japan Kyushu Inst Technol Iizuka Fukuoka Japan Hokkaido Univ Sapporo Hokkaido Japan Tohoku Univ Sendai Miyagi Japan
This paper considers enumeration of specific subgraphs of a given graph by using a data structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the set of solutions quite compactly. Recen... 详细信息
来源: 评论
Computing the Metric Dimension by Decomposing graphs into Extended Biconnected Components (Extended Abstract)  13th
Computing the Metric Dimension by Decomposing Graphs into Ex...
收藏 引用
13th International Conference on algorithms and Computation (WALCOM)
作者: Vietz, Duygu Hoffmann, Stefan Wanke, Egon Heinrich Heine Univ Duesseldorf Univ Str 1 D-40225 Dusseldorf Germany
A vertex set U C V of an undirected graph G = (V, E) is a resolving set for G, if for every two distinct vertices u, v E V there is a vertex w E U such that the distance between u and w and the distance between v and ... 详细信息
来源: 评论
Deep neural network model construction with interactive code reuse and automatic code transformation
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2020年 第18期32卷 e5480-e5480页
作者: Lee, Keon Myung Park, Ki-Sun Hwang, Kyung-Soon Kim, Kwang-Il Chungbuk Natl Univ Dept Comp Sci Cheongju 28644 Chungbuk South Korea Police Jeju Natl Univ Dept Marine Ind & Maritime Jeju South Korea
Many application developers have been recently interested in applying deep learning techniques to their works but have little knowledge and experience on them. This paper presents the methods for a GUI-based modeling ... 详细信息
来源: 评论
A Two-Player Coalition Cooperative Scheme for the Bodyguard Allocation Problem
收藏 引用
Journal of Computer Science & Technology 2018年 第4期33卷 823-837页
作者: Jose Alberto Fernandez-Zepedu Daniel Brubeck-Salcedo Daniel Fajardo-Delgado Hector Zatarain-Aceves Department of Computer Science Center for Scientific Research and Higher Education of Ensenada Ensenada BC 22860 Mexico Department of Systems and Computation Instituto Technol6gico de Ciudad Guzmdn Guzmdn JAL 49100 Mexico
We address the bodyguard allocation problem (BAP), an optimization problem that illustrates the conflict of interest between two classes of processes with contradictory preferences within a distributed system. While... 详细信息
来源: 评论
Distributed Triangle Counting algorithms in Simple graph Stream
Distributed Triangle Counting Algorithms in Simple Graph Str...
收藏 引用
International Conference on Parallel and Distributed Systems (ICPADS)
作者: Mengdi Yu Chao Song Jiqing Gu Ming Liu School of Computer Science and Engineering University of Electronic Science and Technology of China CHINA Big Data Research Center University of Electronic Science and Technology of China CHINA
Recently, the counting algorithm of local topology structures, such as triangles, has been widely used in social network analysis, recommendation systems, user portraits and other fields. At present, one-pass streamin... 详细信息
来源: 评论
Sparse Hardware Embedding of Spiking Neuron Systems for Community Detection
收藏 引用
ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS 2018年 第4期14卷 1–13页
作者: Hamilton, Kathleen E. Imam, Neena Humble, Travis S. Oak Ridge Natl Lab One Bethel Valley Rd Oak Ridge TN 37831 USA
We study the applicability of spiking neural networks and neuromorphic hardware for solving general optimization problems without the use of adaptive training or learning algorithms. We leverage the dynamics of Hopfie... 详细信息
来源: 评论
Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2018年 第9期E101A卷 1363-1374页
作者: Nakahata, Yu Kawahara, Jun Horiyama, Takashi Kasahara, Shoji Nara Inst Sci & Technol Grad Sch Informat Sci Ikoma 6300192 Japan Saitama Univ Grad Sch Sci & Engn Saitama 3388570 Japan
This paper studies a variant of the graph partitioning problem, called the evacuation planning problem, which asks us to partition a target area, represented by a graph, into several regions so that each region contai... 详细信息
来源: 评论
Exact algorithms for weak Roman domination
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 248卷 79-92页
作者: Chapelle, Mathieu Cochefert, Manfred Couturier, Jean-Francois Kratsch, Dieter Letourneur, Romain Liedloff, Mathieu Perez, Anthony IFTS CReSTIC Pole Haute Technol F-08000 Charleville Mezieres France Univ Lorraine Lab Informat Theor & Appl F-57045 Metz 01 France Univ Orleans INSA Ctr Val Loire LIFO EA 4022 FR-45067 Orleans France
We consider the WEAK ROMAN DOMINATION problem. Given an undirected graph G = (V, E), the aim is to find a weak Roman domination function (wrd-function for short) of minimum cost, i.e. a function f : V -> {0, 1, 2} ... 详细信息
来源: 评论
New Bounds for Combinatorial Problems and Quasi-Gray Codes
New Bounds for Combinatorial Problems and Quasi-Gray Codes
收藏 引用
作者: Das, Debarati Charles University of Prague
This thesis consists of two parts. In part I, a group of combinatorial problems pertaining to strings, boolean matrices and graphs is studied. For given two strings x and y, their edit distance is the minimum number o... 详细信息
来源: 评论
An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
收藏 引用
COMPUTATIONAL & APPLIED MATHEMATICS 2018年 第3期37卷 2965-3004页
作者: Gonzaga de Oliveira, Sanderson L. Bernardes, J. A. B. Chagas, G. O. Univ Fed Lavras Lavras Brazil
This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method.... 详细信息
来源: 评论