Imagen de Portada

Incremental Topological Ordering and Cycle Detection with Predictions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	McCauley, Samuel, Moseley, Benjamin, Niaparast, Aidin, Singh, Shikha
Formato:	Preprint
Publicado:	2024
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

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

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

Incremental Strongly Connected Components with Predictions
por: Deng, Ronald, et al.
Publicado: (2026)

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

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

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

Binary Search with Distributional Predictions
por: Dinitz, Michael, et al.
Publicado: (2024)

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

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

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

A Competitive Algorithm for Throughput Maximization on Identical Machines
por: Moseley, Benjamin, et al.
Publicado: (2021)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
por: Arndt, Stephen, et al.
Publicado: (2025)

Competitive Online Transportation Simplified
por: Arndt, Stephen, et al.
Publicado: (2025)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
por: Arndt, Stephen, et al.
Publicado: (2026)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
por: Im, Sungjin, et al.
Publicado: (2023)

Composition Orderings for Linear Functions and Matrix Multiplication Orderings
por: Kubo, Susumu, et al.
Publicado: (2024)

Robust Gittins for Stochastic Scheduling
por: Moseley, Benjamin, et al.
Publicado: (2025)

A Tight Lower Bound for Cycle Detection in Grid Graphs
por: Au, Andrew
Publicado: (2026)

Recent Increments in Incremental View Maintenance
por: Olteanu, Dan
Publicado: (2024)

Computational Complexity of the Interval Ordering Problem
por: Pawlowski, Simeon, et al.
Publicado: (2026)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
por: Davies, Sami, et al.
Publicado: (2025)

Edit and Alphabet-Ordering Sensitivity of Lex-parse
por: Nakashima, Yuto, et al.
Publicado: (2024)

Approximations and Hardness of Packing Partially Ordered Items
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Tight Analyses of Ordered and Unordered Linear Probing
por: Braverman, Mark, et al.
Publicado: (2025)

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

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
por: Bentert, Matthias, et al.
Publicado: (2025)

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
por: Manoussakis, George
Publicado: (2019)

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

Packing Short Cycles
por: Bentert, Matthias, et al.
Publicado: (2024)

The S-Hamiltonian Cycle Problem
por: Amarilli, Antoine, et al.
Publicado: (2026)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)

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

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

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
por: Dasdan, Ali
Publicado: (2025)

Fast Approximate Counting of Cycles
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

OrderedCuts: A new approach for computing Gomory-Hu tree
por: Kolmogorov, Vladimir
Publicado: (2022)

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