咨询与建议

限定检索结果

文献类型

  • 362 篇 期刊文献
  • 146 篇 会议
  • 10 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 409 篇 工学
    • 380 篇 计算机科学与技术...
    • 94 篇 软件工程
    • 64 篇 电气工程
    • 24 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 16 篇 控制科学与工程
    • 6 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 光学工程
  • 212 篇 理学
    • 190 篇 数学
    • 13 篇 生物学
    • 8 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 38 篇 管理学
    • 35 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 12 篇 医学
    • 6 篇 临床医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 特种医学
  • 2 篇 文学
    • 2 篇 新闻传播学
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学

主题

  • 518 篇 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 篇 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

语言

  • 458 篇 英文
  • 58 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
518 条 记 录,以下是251-260 订阅
排序:
On the Konig deficiency of zero-reducible graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2020年 第1期39卷 273-292页
作者: Bartha, Miklos Kresz, Miklos Mem Univ Newfoundland Dept Comp Sci St John NF A1B 3X5 Canada Univ Szeged Juhasz Gyula Fac Educ Boldogasszony Sgt 6 H-6725 Szeged Hungary InnoRenew CoE Izola 6310 Slovenia Univ Primorska Koper 6000 Slovenia
A confluent and terminating reduction system is introduced for graphs, which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost linear time. The Konig... 详细信息
来源: 评论
IPED2: Inheritance Path Based Pedigree Reconstruction algorithm for Complicated Pedigrees
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2017年 第5期14卷 1094-1103页
作者: He, Dan Wang, Zhanyong Parida, Laxmi Eskin, Eleazar IBM Corp Thomas J Watson Res Yorktown Hts NY 10598 USA Univ Calif Los Angeles Los Angeles CA 90095 USA
Reconstruction of family trees, or pedigree reconstruction, for a group of individuals is a fundamental problem in genetics. The problem is known to be NP-hard even for datasets known to only contain siblings. Some re... 详细信息
来源: 评论
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 850卷 98-115页
作者: Bonomo-Braberman, Flavia Chudnovsky, Maria Goedgebeur, Jan Maceli, Peter Schaudt, Oliver Stein, Maya Zhong, Mingxian Univ Buenos Aires Fac Ciencias Exactas & Nat Dept Comp Buenos Aires DF Argentina Univ Buenos Aires CONICET Inst Invest Ciencias Comp ICC Buenos Aires DF Argentina Princeton Univ Princeton NJ 08544 USA Univ Ghent Ghent Belgium Univ Mons Mons Belgium Ithaca Coll Ithaca NY 14850 USA Univ Cologne Cologne Germany Univ Chile Santiago Chile CUNY Lehman Coll Bronx NY 10468 USA CUNY Grad Ctr Bronx NY 10468 USA
We present an algorithm to color a graph G with no triangle and no induced 7-vertex path (i.e., a {P-7, C-3}-free graph), where every vertex is assigned a list of possible colors which is a subset of {1, 2, 3}. While ... 详细信息
来源: 评论
Linear-time algorithm for the matched-domination problem in cographs
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2011年 第10期88卷 2042-2056页
作者: Hung, Ruo-Wei Yao, Chih-Chia Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung 41349 Taiwan
Let G = (V, E) be a graph without isolated vertices. A matching in G is a set of independent edges in G. A perfect matching M in G is a matching such that every vertex of G is incident to an edge of M. A set S subset ... 详细信息
来源: 评论
Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs
收藏 引用
VLDB JOURNAL 2021年 第5期30卷 769-797页
作者: Shao, Yingxia Huang, Shiyue Li, Yawen Miao, Xupeng Cui, Bin Chen, Lei BUPT Sch Comp Sci Natl Pilot Software Engn Sch Beijing Peoples R China BUPT Beijing Key Lab Intelligent Telecommun Software & Beijing Peoples R China BUPT Sch Econ & Management Beijing Peoples R China Peking Univ Dept Comp Sci & Technol Beijing Peoples R China Peking Univ Key Lab High Confidence Software Technol MOE Beijing Peoples R China HKUST Dept Comp Sci & Engn Hong Kong Peoples R China
Second-order random walk is an important technique for graph analysis. Many applications including graph embedding, proximity measure and community detection use it to capture higher-order patterns in the graph, thus ... 详细信息
来源: 评论
PARAMETERIZED COMPLEXITY OF ARC-WEIGHTED DIRECTED STEINER PROBLEMS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2011年 第2期25卷 583-599页
作者: Guo, Jiong Niedermeier, Rolf Suchy, Ondrej Univ Saarland D-66123 Saarbrucken Germany TU Berlin Inst Softwaretech & Theoret Informat D-10587 Berlin Germany Charles Univ Prague Dept Appl Math KAM CR-11800 Prague Czech Republic Charles Univ Prague Inst Theoret Comp Sci ITI CR-11800 Prague Czech Republic
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: directed Steiner tree, strongly connected Steiner subgraph, and directed Ste... 详细信息
来源: 评论
Complexity of the packing coloring problem for trees
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第7期158卷 771-778页
作者: Fiala, Jiri Golovach, Petr A. Univ Bergen Dept Informat N-5020 Bergen Norway Charles Univ Prague Dept Appl Math CR-11800 Prague Czech Republic Charles Univ Prague Inst Theoret Comp Sci ITI CR-11800 Prague Czech Republic
Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise distance greater than i. The main result of this paper is a solution of an open problem o... 详细信息
来源: 评论
Escaping a grid by edge-disjoint paths
收藏 引用
algorithmICA 2003年 第4期36卷 343-359页
作者: Chan, WT Chin, FYL Ting, HF Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n edge-disjoint paths. Different from t... 详细信息
来源: 评论
A simplified algorithm computing all s-t bridges and articulation points
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 305卷 103-108页
作者: Cairo, Massimo Khan, Shahbaz Rizzi, Romeo Schmidt, Sebastian Tomescu, Alexandru, I Zirondelli, Elia C. Univ Helsinki Dept Comp Sci Helsinki Finland Univ Verona Dept Comp Sci Verona Italy Univ Trento Dept Math Trento 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. Similarly, an s-t articulation point of G is a node whose removal breaks all s-t paths of G.... 详细信息
来源: 评论
Kernelization and Complexity Results for Connectivity Augmentation Problems
收藏 引用
NETWORKS 2010年 第2期56卷 131-142页
作者: Guo, Jiong Uhlmann, Johannes Univ Jena Inst Informat D-07743 Jena Germany
Connectivity augmentation problems ask for adding a set of at most k edges (called links) whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivity or biconnectivity. A... 详细信息
来源: 评论