Výsledky vyhľadávania - "Dynamic graph algorithms"

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond Autor Chuzhoy, Julia, Gao, Yu, Li, Jason, Nanongkai, Danupon, Peng, Richard, Saranurak, Thatchaphol

“…We consider the classical Minimum Balanced Cut problem: given a graph G , compute a partition of its vertices into two subsets of roughly equal volume, while…”
Získať plný text

Single-source shortest paths and strong connectivity in dynamic planar graphs Autor Charalampopoulos, Panagiotis, Karczmarz, Adam

“…We give a fully dynamic single-source shortest paths data structure for planar weighted digraphs with O˜(n4/5) worst-case update time and O(log2⁡n) query time…”
Získať plný text

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers Autor Chen, Li, Goranci, Gramoz, Henzinger, Monika, Peng, Richard, Saranurak, Thatchaphol

“…We present a general framework of designing efficient dynamic approximate algorithms for optimization problems on undirected graphs. In particular, we develop…”
Získať plný text

Dynamic Algorithms for Approximate Steiner Trees Autor Raikwar, Hemraj, Sadharakiya, Harshil, Karmakar, Sushanta

“…ABSTRACT This study investigates the dynamic Steiner tree problem. The objective of the Steiner tree problem is to compute a minimum‐weight tree connecting a…”
Získať plný text

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs Autor Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos

“…Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification…”
Získať plný text

Efficient parallel algorithms for dynamic closeness‐ and betweenness centrality Autor Regunta, Sai Charan, Tondomker, Sai Harsh, Shukla, Kshitij, Kothapalli, Kishore

“…Finding the centrality measures of nodes in a graph is a problem of fundamental importance due to various applications from social networks, biological…”
Získať plný text

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs Autor Kashyop, Manas Jyoti, Narayanaswamy, N. S., Nasre, Meghana, Potluri, Sai Mohith

“…The dynamic coloring problem has gained attention in the recent past. The focus has largely been on obtaining efficient update time algorithms using Δ + 1 or…”
Získať plný text

Efficient algorithms for dynamic bidirected Dyck-reachability Autor Li, Yuanbo, Satya, Kris, Zhang, Qirun

“…Dyck-reachability is a fundamental formulation for program analysis, which has been widely used to capture properly-matched-parenthesis program properties such…”
Získať plný text

A Simple Greedy Algorithm for Dynamic Graph Orientation Autor Berglin, Edvin, Brodal, Gerth Stølting

“…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…”
Získať plný text

Meerkat: A Framework for Dynamic Graph Algorithms on GPUs Autor Concessao, Kevin Jude, Cheramangalath, Unnikrishnan, Dev, Ricky, Nasre, Rupesh

“…Graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and…”
Získať plný text

Recent Advances in Efficient Dynamic Graph Processing Autor Chen, Zi, Liang, Keke, Yuan, Long, Zhang, Wenjie, Yang, Zhengyi

“…Graph as one of the most fundamental and representative data structures has found a wide spectrum of emerging application domains such as social media,…”
Získať plný text

Anchor First, Accelerate Next: Revolutionizing GNNs with PIM by Harnessing Stationary Data Autor Chen, Jiaxian, Qi, Yuxuan, Zhu, Yongbiao, Yuan, Jianan, Sun, Kaoyi, Wang, Tianyu, Ma, Chenlin, Wang, Yi

“…Substantial data movement caused by irregular graph topologies hinders the efficient processing of graph neural networks (GNNs). Although the emerging…”
Získať plný text

Near-Optimal Approximate Decremental All Pairs Shortest Paths Autor Chechik, Shiri

“…In this paper we consider the decremental approximate all-pairs shortest paths (APSP) problem, where given a graph G the goal is to maintain approximate…”
Získať plný text

Super-Logarithmic Lower Bounds for Dynamic Graph Problems Autor Larsen, Kasper Green, Yu, Huacheng

“…In this work, we prove a \tilde{\Omega}(\lg^{3/2} n) unconditional lower bound on the maximum of the query time and update time for dynamic data structures…”
Získať plný text

PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration Autor Yang, Tao, Li, Dongyue, Han, Yibo, Zhao, Yilong, Liu, Fangxin, Liang, Xiaoyao, He, Zhezhi, Jiang, Li

“…Graph Convolutional Network (GCN) is a promising but computing- and memory-intensive learning model. Processing-in-memory (PIM) architecture based on the ReRAM…”
Získať plný text

iG-kway: Incremental k-way Graph Partitioning on GPU Autor Lee, Wan Luan, Jiang, Shui, Lin, Dian-Lun, Chang, Che, Zhang, Boyang, Chung, Yi-Hua, Schlichtmann, Ulf, Ho, Tsung-Yi, Huang, Tsung-Wei

“…Recent advances in GPU-accelerated graph partitioning have achieved significant performance gains but remain limited to full graph partitioning, lacking…”
Získať plný text

DyGNN: Algorithm and Architecture Support of Dynamic Pruning for Graph Neural Networks Autor Chen, Cen, Li, Kenli, Zou, Xiaofeng, Li, Yangfan

“…Recently, graph neural networks (GNNs) have achieved great success for graph representation learning tasks. Enlightened by the fact that numerous message…”
Získať plný text

BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning Autor Tong, Shengbo, Pei, Chunyan, Yu, Wenjian

“…Balanced hypergraph partitioning is a fundamental problem in applications like VLSI design, high-performance computing, etc. Nowadays, large-scale hypergraphs…”
Získať plný text

LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing Autor Zhang, Lingling, Wu, Yijian, Jiang, Hong, Zhou, Ziyu, Lu, Tiancheng

“…Dynamic graph processing systems using conventional array-based architectures face significant throughput limitations due to inefficient memory access and…”
Získať plný text

GPart: A GNN-Enabled Multilevel Graph Partitioner Autor Chen, Magi, Wang, Ting-Chi

“…This paper introduces GPart, a scalable multilevel framework for graph partitioning that integrates GNN embeddings with efficient coarsening and refinement…”
Získať plný text