咨询与建议

限定检索结果

文献类型

  • 2,067 篇 期刊文献
  • 820 篇 会议
  • 41 篇 学位论文
  • 7 册 图书
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 2,319 篇 工学
    • 2,077 篇 计算机科学与技术...
    • 518 篇 软件工程
    • 349 篇 电气工程
    • 131 篇 测绘科学与技术
    • 130 篇 建筑学
    • 130 篇 土木工程
    • 129 篇 信息与通信工程
    • 77 篇 控制科学与工程
    • 34 篇 电子科学与技术(可...
    • 22 篇 网络空间安全
    • 20 篇 生物工程
    • 18 篇 材料科学与工程(可...
    • 13 篇 仪器科学与技术
    • 12 篇 交通运输工程
    • 11 篇 化学工程与技术
    • 11 篇 安全科学与工程
    • 10 篇 石油与天然气工程
  • 1,053 篇 理学
    • 944 篇 数学
    • 80 篇 统计学(可授理学、...
    • 62 篇 生物学
    • 51 篇 物理学
    • 27 篇 化学
    • 20 篇 系统科学
  • 190 篇 管理学
    • 140 篇 管理科学与工程(可...
    • 62 篇 图书情报与档案管...
    • 38 篇 工商管理
  • 36 篇 经济学
    • 35 篇 应用经济学
  • 33 篇 医学
    • 16 篇 临床医学
    • 11 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 9 篇 教育学
  • 8 篇 文学
  • 6 篇 农学
  • 1 篇 艺术学

主题

  • 2,936 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 94 篇 parallel algorit...
  • 65 篇 computational co...
  • 64 篇 graph theory
  • 56 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 49 篇 analysis of algo...
  • 45 篇 shortest paths
  • 45 篇 planar graphs
  • 44 篇 treewidth
  • 39 篇 social networks
  • 36 篇 data structures
  • 36 篇 distributed comp...
  • 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 ...
  • 15 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 9 篇 univ vienna fac ...
  • 9 篇 technion israel ...
  • 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
  • 23 篇 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,637 篇 英文
  • 287 篇 其他
  • 7 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2936 条 记 录,以下是291-300 订阅
排序:
SINK-FREE ORIENTATIONS: A LOCAL SAMPLER WITH APPLICATIONS
arXiv
收藏 引用
arXiv 2025年
作者: Anand, Konrad Freifeld, Graham Guo, Heng Wang, Chunyang Wang, Jiaheng School of Informatics University of Edinburgh Informatics Forum EdinburghEH8 9AB United Kingdom State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University 163 Xianlin Avenue Jiangsu Province Nanjing China Faculty of Informatics and Data Science University of Regensburg Bajuwarenstrasse 4 Regensburg93053 Germany
For sink-free orientations in graphs of minimum degree at least 3, we show that there is a deterministic approximate counting algorithm that runs in time O((n73/Ε72) log(n/Ε)), a near-linear time sampling algorithm,... 详细信息
来源: 评论
Cutwidth and Crossings
arXiv
收藏 引用
arXiv 2025年
作者: Rauch, Johannes Rautenbach, Dieter Institute of Optimization and Operations Research Ulm University Ulm Germany
We provide theoretical insights around the cutwidth of a graph and the One-Sided Crossing Minimization (OSCM) problem. OSCM was posed in the Parameterized algorithms and Computational Experiments Challenge 2024, where... 详细信息
来源: 评论
Strassen’s algorithm via orbit flip graphs
arXiv
收藏 引用
arXiv 2025年
作者: Ikenmeyer, Christian Moosbauer, Jakob University of Warwick United Kingdom
We give a short proof for Strassen’s result that the rank of the 2 by 2 matrix multiplication tensor is at most 7. The proof requires no calculations and also no pattern matching or other type of nontrivial verificat... 详细信息
来源: 评论
DECOMPOSITIONS OF TRIANGLE-DENSE graphS
收藏 引用
SIAM JOURNAL ON COMPUTING 2016年 第2期45卷 197-215页
作者: Gupta, Rishi Roughgarden, Tim Seshadhri, C. Stanford Univ Stanford CA 94305 USA Sandia Natl Labs Livermore CA 94551 USA
High triangle density-the graph property stating that a constant fraction of two-hop paths belongs to a triangle-is a common signature of social networks. This paper studies triangle-dense graphs from a structural per... 详细信息
来源: 评论
Linear-Time Multilevel graph Partitioning via Edge Sparsification
arXiv
收藏 引用
arXiv 2025年
作者: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik Sanders, Peter Seemaier, Daniel Google Research Zürich Switzerland Karlsruhe Institute of Technology Karlsruhe Germany
The current landscape of balanced graph partitioning is divided into high-quality but expensive multilevel algorithms and cheaper approaches with linear running time, such as single-level algorithms and streaming algo... 详细信息
来源: 评论
MAINTAINING SHORTEST PATHS UNDER DELETIONS IN WEIGHTED DIRECTED graphS
收藏 引用
SIAM JOURNAL ON COMPUTING 2016年 第2期45卷 548-574页
作者: Bernstein, Aaron Columbia Univ Dept Comp Sci New York NY 10027 USA
We present an improved algorithm for maintaining all-pairs (1 + epsilon) approximate shortest paths under deletions and weight-increases. The previous state of the art for this problem is total update time (O) over ti... 详细信息
来源: 评论
The Case for External graph Sketching
arXiv
收藏 引用
arXiv 2025年
作者: Bender, Michael A. Farach-Colton, Martín Jacob, Riko Komlós, Hanna Tench, David West, Evan T. Stony Brook University United States RelationalAI United States New York University United States IT University of Copenhagen Denmark Lawrence Berkeley National Laboratory United States
algorithms in the data stream model use $O(polylog(N))$ space to compute someproperty of an input of size $N$, and many of these algorithms are implementedand used in practice. However, sketching algorithms in the gra... 详细信息
来源: 评论
Track-to-track association from diverse source ship trajectory based on an improved graph neural network
收藏 引用
Applied Ocean Research 2025年 159卷
作者: Zhang, Jiangnan Liu, Zhenxing Gan, Yanhai Liu, Yongshuo Dong, Junyu Faculty of Information Science and Technology Ocean University of China Shan Dong Qingdao266004 China Faculty of Science and Information Sciences Qingdao Agricultural University Shan Dong Qingdao266100 China
With the development of maritime surveillance technologies, large volumes of ship trajectory data have been collected through various monitoring methods. The accuracy of targets tracking can be significantly improved ... 详细信息
来源: 评论
Faster algorithms for graph Monopolarity
arXiv
收藏 引用
arXiv 2024年
作者: Philip, Geevarghese Sridhara, Shrinidhi Teganahally Chennai Mathematical Institute India UMI ReLaX France Univ. Bordeaux CNRS Bordeaux INP LaBRI UMR 5800 TalenceF-33400 France
A graph G = (V, E) is said to be monopolar if its vertex set admits a partition V = (C (Equation presented) I) where G[C] is a cluster graph and I is an independent set in G. Monopolar graphs generalize both bipartite... 详细信息
来源: 评论
Coded Computing for Distributed graph Analytics
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2020年 第10期66卷 6534-6554页
作者: Prakash, Saurav Reisizadeh, Amirhossein Pedarsani, Ramtin Avestimehr, Amir Salman Univ Southern Calif Dept Elect & Comp Engn Los Angeles CA 90089 USA Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA
Many distributed computing systems have been developed recently for implementing graph based algorithms such as PageRank over large-scale graph-structured datasets such as social networks. Performance of these systems... 详细信息
来源: 评论