Imagen de Portada

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhao, Zhuowei, Zhang, Zhuo, Wang, Hanzhi, Gan, Junhao, Bao, Zhifeng, Qi, Jianzhong
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
por: Zhao, Zhuowei, et al.
Publicado: (2024)

Optimal Dynamic Parameterized Subset Sampling
por: Gan, Junhao, et al.
Publicado: (2024)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
por: Cervenjak, Philip, et al.
Publicado: (2024)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
por: Wang, Hanzhi
Publicado: (2024)

PageRank Centrality in Directed Graphs with Bounded In-Degree
por: Thorup, Mikkel, et al.
Publicado: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
por: Zhao, Jingyang, et al.
Publicado: (2025)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
por: Banik, Aritra, et al.
Publicado: (2025)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
por: Feldmann, Andreas Emil, et al.
Publicado: (2024)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
por: Ning, Baoling, et al.
Publicado: (2024)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
por: Chen, Tianqi, et al.
Publicado: (2025)

Revisiting Local Computation of PageRank: Simple and Optimal
por: Wang, Hanzhi, et al.
Publicado: (2024)

Structural Parameterizations for Two Bounded Degree Problems Revisited
por: Lampis, Michael, et al.
Publicado: (2023)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Dynamic Parameterized Feedback Problems in Tournaments
por: Zych-Pawlewicz, Anna, et al.
Publicado: (2024)

Parameterized Quantum Query Algorithms for Graph Problems
por: Terao, Tatsuya, et al.
Publicado: (2024)

Parameterized Approximability for Modular Linear Equations
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
por: Haeupler, Bernhard, et al.
Publicado: (2024)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
por: Cervenjak, Philip, et al.
Publicado: (2026)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
por: Shah, Vihan
Publicado: (2026)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
por: Gadekar, Ameet
Publicado: (2026)

Instance-Optimality in PageRank Computation
por: Thorup, Mikkel, et al.
Publicado: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
por: Henzinger, Monika, et al.
Publicado: (2024)

Estimating Random-Walk Probabilities in Directed Graphs
por: Bertram, Christian, et al.
Publicado: (2025)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
por: Assadi, Sepehr, et al.
Publicado: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
por: Kulik, Ariel, et al.
Publicado: (2019)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Parameterized Vertex Integrity Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
por: Shen, Fangjian, et al.
Publicado: (2025)

Dynamic Kernel Graph Sparsifiers
por: Cao, Yang, et al.
Publicado: (2022)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
por: Zhao, Yibin
Publicado: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
por: Dong, Sally, et al.
Publicado: (2023)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
por: Cervenjak, Philip, et al.
Publicado: (2023)

Tighter relaxations for MAP-MRF optimization via Singleton Arc Consistency
por: Lev-Ran, Asaf, et al.
Publicado: (2026)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
por: Ma, Xinran, et al.
Publicado: (2025)

Parameterized Approximation of Rectangle Stabbing
por: Chu, Huairui, et al.
Publicado: (2026)