Cover Image

Incremental Strongly Connected Components with Predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deng, Ronald, McCauley, Samuel, Niaparast, Aidin, Niaparast, Helia, Ptak, Bennett, Quintanilla, Shirel, Singh, Shikha, Vosburg, Nathan
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)

Incremental Topological Ordering and Cycle Detection with Predictions
by: McCauley, Samuel, et al.
Published: (2024)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

Faster Global Minimum Cut with Predictions
by: Moseley, Benjamin, et al.
Published: (2025)

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
by: Moseley, Benjamin, et al.
Published: (2024)

Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
by: McCauley, Samuel
Published: (2024)

Space-Efficient Text Indexing with Mismatches using Function Inversion
by: Bibbens, Jackson, et al.
Published: (2026)

Root-to-Leaf Scheduling in Write-Optimized Trees
by: Chung, Christopher, et al.
Published: (2024)

SPIDER: Improved Succinct Rank and Select Performance
by: Laws, Matthew D., et al.
Published: (2024)

Fully Dynamic Strongly Connected Components in Planar Digraphs
by: Karczmarz, Adam, et al.
Published: (2024)

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
by: Dadush, Daniel, et al.
Published: (2025)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
by: Assadi, Sepehr, et al.
Published: (2026)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
by: Assadi, Sepehr, et al.
Published: (2025)

Graph Reconstruction with a Connected Components Oracle
by: Harviainen, Juha, et al.
Published: (2025)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
by: Blažej, Václav, et al.
Published: (2024)

Linear Kernels for $l$-Exact Component Order Connectivity
by: Liu, Yuxi, et al.
Published: (2026)

Reconfiguring Multiple Connected Components with Size Multiset Constraints
by: Nakahata, Yu
Published: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
by: Hoppenworth, Gary, et al.
Published: (2025)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
by: Georgiadis, Loukas, et al.
Published: (2026)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
by: Kumar, Mithilesh, et al.
Published: (2016)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
by: Ameli, Afrouz Jabal, et al.
Published: (2026)

A Strong Linear Programming Relaxation for Weighted Tree Augmentation
by: Cohen-Addad, Vincent, et al.
Published: (2026)

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
by: Liu, Siyue, et al.
Published: (2026)

Recent Increments in Incremental View Maintenance
by: Olteanu, Dan
Published: (2024)

Ghost Value Augmentation for $k$-Edge-Connectivity
by: Hershkowitz, D Ellis, et al.
Published: (2023)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
by: Bérczi, Kristóf, et al.
Published: (2024)

On Incremental Approximate Shortest Paths in Directed Graphs
by: Górkiewicz, Adam, et al.
Published: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
by: Kuszmaul, William, et al.
Published: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
by: Korhonen, Tuukka
Published: (2024)

Coloring Graphs with Few Colors in the Streaming Model
by: Assadi, Sepehr, et al.
Published: (2025)

Carbonyl4: A Sketch for Set-Increment Mixed Updates
by: Zhao, Yikai, et al.
Published: (2024)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
by: Ding, Xiangyun, et al.
Published: (2025)

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
by: Çivril, Ali
Published: (2024)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
by: Hochbaum, Dorit S., et al.
Published: (2025)

Caching Connections in Matchings
by: Sadeh, Yaniv, et al.
Published: (2023)

Universal Perfect Samplers for Incremental Streams
by: Pettie, Seth, et al.
Published: (2024)

Streaming Algorithms for Connectivity Augmentation
by: Jin, Ce, et al.
Published: (2024)

Connected Components in Linear Work and Near-Optimal Time
by: Farhadi, Alireza, et al.
Published: (2023)