咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是201-210 订阅
排序:
Safety in s-t Paths, Trails and Walks
收藏 引用
algorithmICA 2022年 第3期84卷 719-741页
作者: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo Schmidt, Sebastian Tomescu, Alexandru, I Univ Helsinki Dept Comp Sci Helsinki Finland Univ Verona Dept Comp Sci Verona Italy
Given a directed graph G and a pair of nodes s and t, an s-t bridge of G is an edge whose removal breaks all s-t paths of G (and thus appears in all s-t paths). Computing all s-t bridges of G is a basic graph problem,... 详细信息
来源: 评论
Computing bounded-degree phylogenetic roots of disconnected graphs
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2006年 第2期59卷 125-148页
作者: Chen, Zhi-Zhong Tsukiji, Tatsuie Tokyo Denki Univ Dept Math Sci Hatoyama Saitama 3500394 Japan Tokyo Denki Univ Dept Informat Sci Hatoyama Saitama 3500394 Japan
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e., leaves) of T are ex... 详细信息
来源: 评论
Multicast Routing Using Delay Intervals for Collaborative and Competitive Applications
收藏 引用
IEEE TRANSACTIONS ON COMMUNICATIONS 2018年 第12期66卷 6329-6338页
作者: Andrus, James Banik, Shankar M. Swart, Breeanne Baker Verdicchio, Michael The Citadel Dept Math & Comp Sci Charleston SC 29409 USA
Collaborative and competitive applications require that participants receive messages almost simultaneously and before a specified time. These requirements have been addressed by the delay variation-bounded multicasti... 详细信息
来源: 评论
Enumerating All Rooted Trees Including k Leaves
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2012年 第3期E95D卷 763-768页
作者: Ishikawa, Masanobu Yamanaka, Katsuhisa Otachi, Yota Nakano, Shin-ichi Gunma Univ Dept Comp Sci Kiryu Gunma 3768515 Japan Iwate Univ Dept Elect Engn & Comp Sci Morioka Iwate 0208551 Japan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
This paper presents an efficient algorithm to generate all (unordered) rooted trees with exactly vertices including exactly k leaves. There are known results on efficient enumerations of some classes of graphs embedde... 详细信息
来源: 评论
Efficient semi-external depth-first search
收藏 引用
INFORMATION SCIENCES 2022年 599卷 170-191页
作者: Wan, Xiaolong Wang, Hongzhi Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China
As graphs grow in size, many real-world graphs are difficult to load into the primary memory of a computer. Thus, computing depth-first search (DFS) results (i.e., depth-first order or DFS-Tree) on the semi-external m... 详细信息
来源: 评论
Complexity and algorithms for Semipaired Domination in graphs
收藏 引用
THEORY OF COMPUTING SYSTEMS 2020年 第7期64卷 1225-1241页
作者: Henning, Michael A. Pandey, Arti Tripathi, Vikash Univ Johannesburg Dept Math & Appl Math ZA-2006 Auckland Pk South Africa Indian Inst Technol Ropar Dept Math Nangal Rd Rupnagar 140001 Punjab India
For a graph G = (V, E) with no isolated vertices, a set D subset of V is called a semipaired dominating set of G if (i) D is a dominating set of G, and (ii) D can be partitioned into two element subsets such that the ... 详细信息
来源: 评论
algorithms and obstructions for linear-width and related search parameters
收藏 引用
DISCRETE APPLIED MATHEMATICS 2000年 第1-3期105卷 239-271页
作者: Thilikos, DM Univ Politecn Catalunya Dept Llenguatges & Sistemes Informat E-08034 Barcelona Spain
The linear-width of a graph G is defined to be the smallest integer k such that the edges of G can be arranged in a linear ordering (e(1),...,e(r)) in such a way that for every i = 1,..., r - 1, there are at most k ve... 详细信息
来源: 评论
Efficient community detection with additive constrains on large networks
收藏 引用
KNOWLEDGE-BASED SYSTEMS 2013年 52卷 268-278页
作者: Li, Yakun Wang, Hongzhi Li, Jianzhong Gao, Hong Harbin Inst Technol Dept Comp Sci & Technol Harbin 150001 Peoples R China
The community structure is one of the most important patterns in network. Since finding the communities in the network can significantly improve our understanding of the complex relations, lots of work has been done i... 详细信息
来源: 评论
AN O(LOG N) algorithm FOR PARALLEL UPDATE OF MINIMUM SPANNING-TREES
收藏 引用
INFORMATION PROCESSING LETTERS 1986年 第5期22卷 223-229页
作者: PAWAGI, S RAMAKRISHNAN, IV Department of Computer Science University of Maryland College Park MD 20742 U.S.A.
Incremental graph algorithms deal with recomputing properties of a graph after an incremental change is made to that graph, such as adding and deleting vertices and edges. Such recomputations are ''updating&#... 详细信息
来源: 评论
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... 详细信息
来源: 评论