咨询与建议

限定检索结果

文献类型

  • 360 篇 期刊文献
  • 145 篇 会议
  • 10 篇 学位论文

馆藏范围

  • 515 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 406 篇 工学
    • 378 篇 计算机科学与技术...
    • 93 篇 软件工程
    • 63 篇 电气工程
    • 23 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 15 篇 控制科学与工程
    • 6 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 光学工程
  • 210 篇 理学
    • 188 篇 数学
    • 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
  • 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 篇 network optimiza...
  • 8 篇 planar graph
  • 8 篇 interval graphs
  • 8 篇 reordering algor...
  • 8 篇 parallel algorit...
  • 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 篇 univ bergen dept...
  • 4 篇 univ helsinki de...
  • 4 篇 shandong univ sc...
  • 3 篇 georgia inst tec...
  • 3 篇 tsinghua univ de...
  • 3 篇 bell laboratorie...

作者

  • 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
  • 6 篇 uno yushi
  • 6 篇 zhang zhongzhi
  • 5 篇 paul s.
  • 5 篇 cui bin
  • 5 篇 kawahara jun
  • 5 篇 qin lu
  • 5 篇 chen lei
  • 5 篇 lin xuemin

语言

  • 456 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph algorithm"
515 条 记 录,以下是111-120 订阅
排序:
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... 详细信息
来源: 评论
Complexity of the multi-service center problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 842卷 18-27页
作者: Ito, Takehiro Kakimura, Naonori Kobayashi, Yusuke Tohoku Univ Sendai Miyagi Japan Keio Univ Tokyo Japan Kyoto Univ Kyoto Japan
The multi-service center problem is a variant of facility location problems. In the problem, we consider locating p facilities on a graph, each of which provides distinct service required by all vertices. Each vertex ... 详细信息
来源: 评论
Irregularity Strength of Circulant graphs Using algorithmic Approach
收藏 引用
IEEE ACCESS 2021年 9卷 54401-54406页
作者: Asim, Muhammad Ahsan Hasni, Roslan Ahmad, Ali Assiri, Basem Semanicova-Fenovcikova, Andrea Jazan Univ Coll Comp Sci & Informat Technol Jazan 82727 Saudi Arabia Univ Malaysia Terengganu Sch Informat & Appl Math Kuala Terengganu 21030 Malaysia Tech Univ Dept Appl Math & Informat Kosice 04001 Slovakia
This paper deals with decomposition of complete graphs on n vertices into circulant graphs with reduced degree r < n - 1. They are denoted as C-n(a(1), a(2), ... , a(m)), where a(1) to a(m) are generators. Mathemat... 详细信息
来源: 评论
Finding a Friendly Community in Social Networks Considering Bad Relationships
收藏 引用
COMPUTER JOURNAL 2015年 第6期58卷 1469-1481页
作者: Kim, Sang-Yeon Choi, Dong-Wan Chung, Chin-Wan Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea
Community detection in social networks is one of the most active problems with lots of applications. Most of the existing works on the problem have focused on detecting the community considering only the closeness bet... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Efficient Minimum Spanning Tree algorithms on the Reconfigurable Mesh
收藏 引用
Journal of Computer Science & Technology 2000年 第2期15卷 116-125页
作者: 万颖瑜 许胤龙 顾晓东 陈国良 Department of Computer Science and Technology University of Science and Technology of China National High Performance Computation Center at Hefei Hefei P.R. China
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recent... 详细信息
来源: 评论
EQUIVALENT APPROXIMATION algorithmS FOR NODE COVER
收藏 引用
INFORMATION PROCESSING LETTERS 1986年 第6期22卷 291-294页
作者: GUSFIELD, D PITT, L Department of Computer Science Yale University 10 Hillhouse Avenue New Haven CT 06520 U.S.A.
The node cover problem is the problem of determining the minimum size (or weight in the weighted version) node set C in an undirected graph G, so that every edge of G is incident with at least one node of C. Both the... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Signal-path-level dual-Vt assignment for leakage power
收藏 引用
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2006年 第2期15卷 197-216页
作者: Wang, Yu Yang, Huazhong Wang, Hui Tsinghua Univ Dept Elect Engn Circuit & Syst Div Beijing 100084 Peoples R China
Along with the fast development of dual-threshold voltage (dual-V-t) and multi-threshold technology, it is possible to use them to reduce static power in low-voltage high-performance circuits. In this paper, we propos... 详细信息
来源: 评论
algorithms for the Independent Feedback Vertex Set Problem
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2015年 第6期E98A卷 1179-1188页
作者: Tamura, Yuma Ito, Takehiro Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan JST ERATO Kawarabayashi Large Graph Project Global Res Ctr Big Data MathNII Tokyo 1018430 Japan
A feedback vertex set F of an undirected graph G is a vertex subset of G whose removal results in a forest. Such a set F is said to be independent if F forms an independent set of G. In this paper, we study the proble... 详细信息
来源: 评论