咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
SpiderDAN: Matching Augmentation in Demand-Aware Networks
SpiderDAN: Matching Augmentation in Demand-Aware Networks
收藏 引用
2025 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2025
作者: Figiel, Aleksander Melnyk, Darya Nichterlein, André Pourdamghani, Arash Schmid, Stefan Technische Universität Berlin Germany
graph augmentation is a fundamental and well-studied problem that arises in network optimization. We consider a new variant of this model motivated by reconfigurable communication networks. In this variant, we conside... 详细信息
来源: 评论
Sampling Unlabeled Chordal graphs in Expected Polynomial Time  42
Sampling Unlabeled Chordal Graphs in Expected Polynomial Tim...
收藏 引用
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
作者: Hébert-Johnson, Úrsula Lokshtanov, Daniel University of California Santa BarbaraCA United States
We design an algorithm that generates an n-vertex unlabeled chordal graph uniformly at random in expected polynomial time. Along the way, we develop the following two results: (1) an FPT algorithm for counting and sam... 详细信息
来源: 评论
Computing graph Hyperbolicity Using Dominating Sets
Computing Graph Hyperbolicity Using Dominating Sets
收藏 引用
Symposium on Algorithm Engineering and Experiments (ALENEX)
作者: Coudert, David Nusser, Andre Viennot, Laurent Univ Cote dAzur I3S CNRS INRIA Nice France Saarbrucken Grad Sch Comp Sci Saarland Informat Campus Saarbrucken Germany Max Planck Inst Informat Saarland Informat Campus Saarbrucken Germany Paris Univ Irif CNRS INRIA Paris France
Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using... 详细信息
来源: 评论
graph Summarization: Compactness Meets Efficiency
收藏 引用
Proceedings of the ACM on Management of Data 2024年 第3期2卷 1-26页
作者: Deming Chu Fan Zhang Wenjie Zhang Ying Zhang Xuemin Lin University of New South Wales Sydney NSW Australia Guangzhou University Guangzhou Guangdong China University of Technology Sydney Sydney NSW Australia Shanghai Jiao Tong University Shanghai China
As the volume and ubiquity of graphs increase, a compact graph representation becomes essential for enabling efficient storage, transfer, and processing of graphs. Given a graph, the graph summarization problem asks f... 详细信息
来源: 评论
Revisiting Local Computation of PageRank: Simple and Optimal  2024
Revisiting Local Computation of PageRank: Simple and Optimal
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Wang, Hanzhi Wei, Zhewei Wen, Ji-Rong Yang, Mingji Renmin Univ China Beijing Peoples R China
We revisit ApproxContributions, the classic local graph exploration algorithm proposed by Andersen, Borgs, Chayes, Hopcroft, Mirrokni, and Teng (WAW 07, Internet Math. 08) for computing an epsilon-approximation of the... 详细信息
来源: 评论
Spanning Adjacency Oracles in Sublinear Time  15
Spanning Adjacency Oracles in Sublinear Time
收藏 引用
15th Innovations in Theoretical Computer Science Conference (ITCS)
作者: Bodwin, Greg Fleischmann, Henry Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Cambridge Dept Pure Math & Math Stat Cambridge England
Suppose we are given an n-node, m-edge input graph G, and the goal is to compute a spanning subgraph H on O(n) edges. This can be achieved in linear O(m + n) time via breadth-first search. But can we hope for sublinea... 详细信息
来源: 评论
VICAN: Very Efficient Calibration Algorithm for Large Camera Networks
VICAN: Very Efficient Calibration Algorithm for Large Camera...
收藏 引用
IEEE International Conference on Robotics and Automation (ICRA)
作者: Moreira, Gabriel Marques, Manuel Costeira, Jodo Paulo Hauptman, Alexander Carnegie Mellon Univ Sch Comp Sci Language Technol Inst Pittsburgh PA 15213 USA Inst Super Tecn Inst Syst & Robot Lisbon Portugal
The precise estimation of camera poses within large camera networks is a foundational problem in computer vision and robotics, with broad applications spanning autonomous navigation, surveillance, and augmented realit... 详细信息
来源: 评论
The lattice of cycles of an undirected graph
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2021年 611卷 213-236页
作者: Averkov, G. Chavez, A. De Loera, J. A. Gillespie, B. BTU Cottbus Senftenberg Fak 1 Cottbus Germany Univ Calif Davis Dept Math Davis CA 95616 USA Colorado State Univ Dept Math Ft Collins CO 80523 USA
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including ... 详细信息
来源: 评论
Geometric Spanners: New algorithms and Frameworks
Geometric Spanners: New Algorithms and Frameworks
收藏 引用
作者: Khodabandeh, Hadi University of California Irvine
学位级别:Ph.D., Doctor of Philosophy
In this dissertation, we investigate a multitude of novel algorithms aimed at efficiently constructing geometric spanners across various computational scenarios. In addition to devising new algorithms, we also develop... 详细信息
来源: 评论
Combinatorics in AI: Principles & algorithms An Extended Abstract
Combinatorics in AI: Principles & Algorithms An Extended Abs...
收藏 引用
2024 IEEE International Conferences of AI, Science, Engineering, and Technology, AIxSET 2024
作者: Barr, Joseph R. Haass, Jon C Shaw, Peter Abu-Khzam, Faisal N. Embry-Riddle Aeronautical University United States Oujiang Laboratory Zhejiang Wenzhou China Lebanese American University Dept. of Comp. Sc. & Mathematics Lebanon
Therein we describe a few cases where combinatorics appears in machine learning. The fundamental problem of learning is intimately connected to combinatorial geometry. The geometric invariant Vapnik-Chvronenkis dimens... 详细信息
来源: 评论