咨询与建议

限定检索结果

文献类型

  • 2,066 篇 期刊文献
  • 816 篇 会议
  • 41 篇 学位论文
  • 6 册 图书
  • 1 篇 资讯

馆藏范围

  • 2,929 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 2,315 篇 工学
    • 2,073 篇 计算机科学与技术...
    • 515 篇 软件工程
    • 347 篇 电气工程
    • 130 篇 土木工程
    • 129 篇 信息与通信工程
    • 129 篇 建筑学
    • 129 篇 测绘科学与技术
    • 77 篇 控制科学与工程
    • 33 篇 电子科学与技术(可...
    • 20 篇 生物工程
    • 20 篇 网络空间安全
    • 18 篇 材料科学与工程(可...
    • 14 篇 仪器科学与技术
    • 11 篇 化学工程与技术
    • 10 篇 石油与天然气工程
    • 10 篇 交通运输工程
    • 10 篇 生物医学工程(可授...
  • 1,052 篇 理学
    • 943 篇 数学
    • 81 篇 统计学(可授理学、...
    • 62 篇 生物学
    • 52 篇 物理学
    • 27 篇 化学
    • 20 篇 系统科学
  • 188 篇 管理学
    • 138 篇 管理科学与工程(可...
    • 61 篇 图书情报与档案管...
    • 37 篇 工商管理
  • 35 篇 经济学
    • 34 篇 应用经济学
  • 32 篇 医学
    • 16 篇 临床医学
    • 10 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 8 篇 教育学
  • 8 篇 文学
  • 7 篇 农学
  • 1 篇 艺术学

主题

  • 2,930 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 94 篇 parallel algorit...
  • 66 篇 computational co...
  • 65 篇 graph theory
  • 55 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 50 篇 analysis of algo...
  • 45 篇 shortest paths
  • 45 篇 planar graphs
  • 44 篇 treewidth
  • 38 篇 social networks
  • 37 篇 distributed comp...
  • 36 篇 data structures
  • 33 篇 distributed algo...
  • 29 篇 parameterized al...
  • 29 篇 complexity
  • 29 篇 np-completeness
  • 26 篇 interval graphs

机构

  • 24 篇 univ bergen dept...
  • 19 篇 univ elect sci &...
  • 16 篇 ben gurion univ ...
  • 14 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 10 篇 technion israel ...
  • 9 篇 univ vienna fac ...
  • 9 篇 brno university ...
  • 9 篇 carnegie mellon ...
  • 9 篇 univ rostock ins...
  • 8 篇 indian inst tech...
  • 8 篇 simon fraser uni...
  • 8 篇 chinese univ hon...
  • 8 篇 swiss fed inst t...
  • 8 篇 carnegie mellon ...
  • 8 篇 natl inst inform...
  • 8 篇 tel aviv univ sc...

作者

  • 31 篇 xiao mingyu
  • 22 篇 tsur dekel
  • 18 篇 saurabh saket
  • 17 篇 panda b. s.
  • 16 篇 fomin fedor v.
  • 13 篇 bader david a.
  • 13 篇 bodlaender hans ...
  • 13 篇 pandey arti
  • 13 篇 lokshtanov danie...
  • 12 篇 kratsch dieter
  • 11 篇 karthick t.
  • 11 篇 de figueiredo ce...
  • 11 篇 henzinger monika
  • 11 篇 bodlaender hl
  • 11 篇 nanongkai danupo...
  • 10 篇 mcmillan scott
  • 10 篇 nagamochi hirosh...
  • 10 篇 low tze meng
  • 10 篇 dragan feodor f.
  • 9 篇 dondi riccardo

语言

  • 2,643 篇 英文
  • 278 篇 其他
  • 8 篇 中文
  • 2 篇 德文
  • 2 篇 斯洛文尼亚文
  • 1 篇 法文
  • 1 篇 土耳其文
检索条件"主题词=graph algorithms"
2930 条 记 录,以下是121-130 订阅
排序:
Approximation algorithms for multi-parameter graph optimization problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第1-2期119卷 129-138页
作者: Basov, I Vainshtein, A Univ Haifa Dept Math IL-31905 Haifa Israel Univ Haifa Dept Comp Sci IL-31905 Haifa Israel
Given a graph with k greater than or equal to 2 different nonnegative weights associated with each edge e and a cost function c: R-k --> R+, consider the problem of finding a minimum-cost edge subset possessing a c... 详细信息
来源: 评论
Work efficient parallel algorithms for large graph exploration on emerging heterogeneous architectures
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2015年 76卷 81-93页
作者: Banerjee, Dip Sankar Kumar, Ashutosh Chaitanya, Meher Sharma, Shashank Kothapalli, Kishore Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India
graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. There are severa... 详细信息
来源: 评论
Fast FPGA Accelerator of graph Cut Algorithm with Threshold Global Relabel and Inertial Push
收藏 引用
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年
作者: Yan, Guangyao Liu, Xinzhe Wang, Hui Ha, Yajun ShanghaiTech University School of Information Science and Technology Shanghai201210 China University of Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering Beijing100049 China Chinese Academy of Sciences Shanghai Advanced Research Institute Shanghai201203 China Chinese Academy of Sciences Microelectronics The Shanghai Advanced Research Institute Shanghai201203 China Shanghai Engineering Research Center of Energy Efficient and Custom AI Integrated Circuits Shanghai201210 China
graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory resource utilization optimizatio... 详细信息
来源: 评论
The Complexity of Diameter on H-free graphs  50th
The Complexity of Diameter on H-free Graphs
收藏 引用
50th International Workshop on graph-Theoretic Concepts in Computer Science
作者: Oostveen, Jelle J. Paulusma, Daniel van Leeuwen, Erik Jan Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands Univ Durham Dept Comp Sci Durham England
The intensively studied DIAMETER problem is to find the diameter of a given connected graph. We investigate, for the first time in a structured manner, the complexity of DIAMETER for H-free graphs, that is, graphs tha... 详细信息
来源: 评论
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第15期158卷 1660-1667页
作者: Takata, Ken Hamline Univ Dept Math St Paul MN 55104 USA
For a graph G in read-only memory on n vertices and m edges and a write-only output buffer, we give two algorithms using only O(n) rewritable space. The first algorithm lists all minimal a - b separators of G with a p... 详细信息
来源: 评论
Distributed Hop-Constrained s-t Simple Path Enumeration in Labelled graphs  35th
Distributed Hop-Constrained s-t Simple Path Enumeration in L...
收藏 引用
35th Australasian Database Conference
作者: Li, Xia Yang, Zhengyi Hao, Kongzhang Shu, Xin Cao, Xin Zhang, Wenjie Univ New South Wales Sydney NSW 2052 Australia BFJ Pty Ltd Sydney NSW 2000 Australia
Hop-constrained s-t simple path (HC-s-t path) enumeration is a core problem in graph analysis, commonly applied to unlabelled graphs without considering label constraints. However, in many practical scenarios, graphs ... 详细信息
来源: 评论
EFFICIENT PARALLEL algorithms FOR A CLASS OF graph THEORETIC PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 1984年 第3期13卷 580-599页
作者: TSIN, YH CHIN, FY UNIV ALBERTA DEPT COMP SCIEDMONTON T6G 2H1ALBERTACANADA
In this paper, we present efficient parallel algorithms for the following graph problems: finding the lowest common ancestors for vertex pairs of a directed tree; finding all fundamental cycles, a directed spanning fo... 详细信息
来源: 评论
algorithms for maximum internal spanning tree problem for some graph classes
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第5期44卷 3419-3445页
作者: Sharma, Gopika Pandey, Arti Wigal, Michael C. Indian Inst Technol Ropar Dept Math Rupnagar 140001 Punjab India Georgia Inst Technol Sch Math Atlanta GA 30332 USA
For a given graph G, a maximum internal spanning tree of G is a spanning tree of G with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tre... 详细信息
来源: 评论
POSTER: Triangle Counting on Tensor Cores  30
POSTER: Triangle Counting on Tensor Cores
收藏 引用
30th Symposium on Principles and Practice of Parallel Programming
作者: Chen, YuAng Yu, Jeffrey Xu Chinese Univ Hong Kong Hong Kong Peoples R China
Triangle counting is a fundamental graph algorithm used to identify the number of triangles within a graph. This algorithm can be reformulated into linear algebraic operations, including sparse matrix multiplication, ... 详细信息
来源: 评论
Approximation algorithms for Treewidth, Pathwidth, and Treedepth-A Short Survey  50th
Approximation Algorithms for Treewidth, Pathwidth, and Treed...
收藏 引用
50th International Workshop on graph-Theoretic Concepts in Computer Science
作者: Bodlaender, Hans L. Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands
This short survey discusses old and new approximation algorithms for treewidth, and for the related parameters pathwidth and treedepth.
来源: 评论