咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是191-200 订阅
排序:
A linear algorithm for semi-external cutnode computation
收藏 引用
INFORMATION SCIENCES 2022年 615卷 368-384页
作者: Wan, Xiaolong Wang, Hongzhi Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China
In the literature, many algorithms have been proposed for finding cutnodes on undirected graphs, since cutnodes are crucial to graph connectivity. Here, a cutnode of an undirected graph G is a node of G, whose deletio... 详细信息
来源: 评论
Efficient approximation algorithms for shortest cycles in undirected graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第10期109卷 493-498页
作者: Lingas, Andrzej Lundell, Eva-Marta Lund Univ Dept Comp Sci S-22100 Lund Sweden
We describe a simple combinatorial approximation algorithm for finding a shortest (simple) cycle in an undirected graph. Given an adjacency-list representation of an undirected graph G with n vertices and unknown girt... 详细信息
来源: 评论
An improved approximation algorithm for capacitated multicast routings in networks
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第1期390卷 81-91页
作者: Morsy, Ehab Nagamochi, Hiroshi Kyoto Univ Grad Sch Informat Dept Appl Math & Phys Kyoto 6068501 Japan
Let G = (V, E) be a connected graph such that each edge e is an element of E is weighted by nonnegative real w(e). Let s be a vertex designated as a source, k be a positive integer, and S subset of V be a set of termi... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Efficient Semi-External SCC Computation
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2023年 第4期35卷 3794-3807页
作者: Wan, Xiaolong Wang, Hongzhi Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China
In literature, many algorithms are proposed to find strongly connected components (SCC) for directed graphs. Specifically, a SCC of a directed graph G is one of its maximal subgraphs, in which any two nodes are reacha... 详细信息
来源: 评论
Generalized rainbow connectivity of graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第0期555卷 35-42页
作者: Uchizawa, Kei Aoki, Takanori Ito, Takehiro Zhou, Xiao Yamagata Univ Grad Sch Sci & Engn Yonezawa Yamagata 9928510 Japan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
Let C = {c(1), c(2), ..., c(k)} be a set of k colors, and let (l) over right arrow = (l(1), l(2), ..., l(k)) be a k-tuple of nonnegative integers l(1), l(2), ..., l(k). For a graph G = (V, E), let f : E -> C be an ... 详细信息
来源: 评论
Reconfiguring (non-spanning) arborescences
收藏 引用
THEORETICAL COMPUTER SCIENCE 2023年 第1期943卷 131-141页
作者: Ito, Takehiro Iwamasa, Yuni Kobayashi, Yasuaki Nakahata, Yu Otachi, Yota Wasa, Kunihiro Tohoku Univ Grad Sch Informat Sci Sendai Japan Kyoto Univ Grad Sch Informat Kyoto Japan Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Japan Nara Inst Sci & Technol Div Informat Sci Nara Japan Nagoya Univ Grad Sch Informat Nagoya Japan Hosei Univ Fac Sci & Engn Tokyo Japan
In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem of reconfiguring arborescences in a digraph, where an arbo... 详细信息
来源: 评论
Clustering as a dual problem to colouring
收藏 引用
COMPUTATIONAL & APPLIED MATHEMATICS 2022年 第4期41卷 1-36页
作者: Ikica, Barbara Gabrovsek, Bostjan Povh, Janez Zerovnik, Janez Univ Ljubljana Fac Math & Phys Ljubljana Slovenia Inst Math Phys & Mech Ljubljana Slovenia Univ Ljubljana Fac Mech Engn Ljubljana Slovenia
An essential step towards gaining a deeper insight into intricate mechanisms underlying the formation and functioning of complex networks is extracting and understanding their building blocks encoded in the clustering... 详细信息
来源: 评论
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 第1期575卷 33-41页
作者: Bhushan, Alka Sajith, G. Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India
The problem of finding the minimum cut of an undirected unweighted graph is studied on the external memory model. First, a lower bound of Omega((E/V)Sort(V)) on the number of I/Os is shown for the problem, where V is ... 详细信息
来源: 评论
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.... 详细信息
来源: 评论