咨询与建议

限定检索结果

文献类型

  • 44 篇 期刊文献
  • 30 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 69 篇 工学
    • 67 篇 计算机科学与技术...
    • 17 篇 软件工程
    • 4 篇 电气工程
    • 1 篇 控制科学与工程
  • 31 篇 理学
    • 31 篇 数学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 74 篇 dynamic graph al...
  • 8 篇 shortest paths
  • 8 篇 data structures
  • 6 篇 algorithms
  • 4 篇 connectivity
  • 4 篇 edge orientation...
  • 4 篇 graph arboricity
  • 4 篇 reachability
  • 4 篇 graph coloring
  • 3 篇 graph algorithms
  • 3 篇 random graphs
  • 3 篇 average-case ana...
  • 3 篇 transitive closu...
  • 2 篇 graph decomposit...
  • 2 篇 graph connectivi...
  • 2 篇 minimum spanning...
  • 2 篇 buchi objectives
  • 2 篇 graph games
  • 2 篇 cell-probe lower...
  • 2 篇 journey planning

机构

  • 8 篇 univ vienna fac ...
  • 5 篇 univ vienna aust...
  • 4 篇 univ roma la sap...
  • 4 篇 kth royal inst t...
  • 3 篇 tel aviv univ po...
  • 3 篇 georgia inst tec...
  • 3 篇 indian inst tech...
  • 3 篇 aarhus univ aarh...
  • 3 篇 univ roma tor ve...
  • 3 篇 univ roma tor ve...
  • 2 篇 univ sci & techn...
  • 2 篇 univ copenhagen ...
  • 2 篇 univ roma la sap...
  • 2 篇 inst math sci ch...
  • 2 篇 max planck inst ...
  • 2 篇 columbia univ de...
  • 2 篇 google inc mount...
  • 2 篇 univ waterloo sc...
  • 2 篇 mit 77 massachus...
  • 1 篇 ist austria klos...

作者

  • 15 篇 henzinger monika
  • 9 篇 nanongkai danupo...
  • 7 篇 krinninger sebas...
  • 5 篇 italiano giusepp...
  • 4 篇 demetrescu camil
  • 4 篇 italiano gf
  • 4 篇 solomon shay
  • 3 篇 bhattacharya say...
  • 3 篇 narayanaswamy n....
  • 3 篇 peng richard
  • 3 篇 friedrich tobias
  • 3 篇 saranurak thatch...
  • 3 篇 kashyop manas jy...
  • 3 篇 peng pan
  • 2 篇 chan timothy m.
  • 2 篇 henzinger mr
  • 2 篇 brodal gerth sto...
  • 2 篇 khan imran
  • 2 篇 monika henzinger
  • 2 篇 d'emidio mattia

语言

  • 71 篇 英文
  • 3 篇 其他
检索条件"主题词=dynamic graph algorithms"
74 条 记 录,以下是1-10 订阅
排序:
Sparsification - A technique for speeding up dynamic graph algorithms
收藏 引用
JOURNAL OF THE ACM 1997年 第5期44卷 669-696页
作者: Eppstein, D Galil, Z Italiano, GF Nissenzweig, A Univ Calif Irvine Dept Informat & Comp Sci Irvine CA 92717 USA Columbia Univ Dept Comp Sci New York NY 10027 USA Univ Ca Foscari Venezia Dipartimento Matemat Applicata & Informat Venice Italy Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel
We provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge conne... 详细信息
来源: 评论
Meerkat: A Framework for dynamic graph algorithms on GPUs
收藏 引用
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2024年 第5-6期52卷 400-453页
作者: Concessao, Kevin Jude Cheramangalath, Unnikrishnan Dev, Ricky Nasre, Rupesh Indian Inst Technol Palakkad Dept Comp Sci & Engn Palakkad India Indian Inst Technol Madras Dept Comp Sci & Engn Chennai India
graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions... 详细信息
来源: 评论
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
收藏 引用
JOURNAL OF THE ACM 1999年 第4期46卷 502-516页
作者: Henzinger, MR King, V Google Inc Mountain View CA 94043 USA Univ Victoria Dept Comp Sci Victoria BC Canada
This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarit... 详细信息
来源: 评论
On the Complexity of algorithms with Predictions for dynamic graph Problems  15
On the Complexity of Algorithms with Predictions for Dynamic...
收藏 引用
15th Innovations in Theoretical Computer Science Conference (ITCS)
作者: Henzinger, Monika Saha, Barna Seybold, Martin P. Ye, Christopher Inst Sci & Technol Austria ISTA Klosterneuburg Austria Univ Calif San Diego La Jolla CA 92093 USA Univ Vienna Vienna Austria
algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds ... 详细信息
来源: 评论
dynamic algorithms for Approximate Steiner Trees
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2025年 第6-8期37卷
作者: Raikwar, Hemraj Sadharakiya, Harshil Karmakar, Sushanta Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati India
This study investigates the dynamic Steiner tree problem. The objective of the Steiner tree problem is to compute a minimum-weight tree connecting a set of designated vertices called terminals in a connected weighted ... 详细信息
来源: 评论
Faster and dynamic algorithms For Maximal End-Component Decomposition And Related graph Problems In Probabilistic Verification  11
Faster and Dynamic Algorithms For Maximal End-Component Deco...
收藏 引用
Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms
作者: Krishnendu Chatterjee Monika Henzinger Institute of Science and Technology Austria Fakultat fur Informatik Universitat Wien
We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the a... 详细信息
来源: 评论
A Simple Greedy Algorithm for dynamic graph Orientation
收藏 引用
ALGORITHMICA 2020年 第2期82卷 245-259页
作者: Berglin, Edvin Brodal, Gerth Stolting Aarhus Univ Aarhus Denmark
graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent... 详细信息
来源: 评论
A Simple Greedy Algorithm for dynamic graph Orientation  28
A Simple Greedy Algorithm for Dynamic Graph Orientation
收藏 引用
28th International Symposium on algorithms and Computation (ISAAC)
作者: Berglin, Edvin Brodal, Gerth Stolting Aarhus Univ Aarhus Denmark
graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent... 详细信息
来源: 评论
Parallel Batch-dynamic graph Connectivity  19
Parallel Batch-Dynamic Graph Connectivity
收藏 引用
31st ACM Symposium on Parallelism in algorithms and Architecturess (SPAA)
作者: Acar, Umut A. Anderson, Daniel Blelloch, Guy E. Dhulipala, Laxman Carnegie Mellon Univ Pittsburgh PA 15213 USA
In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. The best sequential algorithm for dynam... 详细信息
来源: 评论
An Invitation to dynamic graph Problems: Lower Bounds - III
收藏 引用
RESONANCE-JOURNAL OF SCIENCE EDUCATION 2022年 第10期27卷 1777-1787页
作者: Kashyop, Manas Jyoti Narayanaswamy, N. S. Inst Math Sci Chennai Tamil Nadu India IIT Madras Dept CSE Chennai Tamil Nadu India
In this section of Resonance, we invite readers to pose questions likely to be raised in a classroom situation. We may suggest strategies for dealing with them, or invite responses, or both. "Classroom" is e... 详细信息
来源: 评论