:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	D'Elia, Marco, Finocchi, Irene, Patrignani, Maurizio
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms G.2.2
Acceso en línea:	https://arxiv.org/abs/2511.03525
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Speeding-up Graph Algorithms via Clique Partitioning
por: Chavan, Akshar, et al.
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
por: Høgemo, Svein
Publicado: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

High-Modularity Graph Partitioning Through NLP Techniques and Maximal Clique Enumeration
por: D'Elia, Marco, et al.
Publicado: (2026)

Graph Threading
por: Demaine, Erik D., et al.
Publicado: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
por: Jędrzejczak, Patryk, et al.
Publicado: (2025)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
por: Szyfelbein, Michał
Publicado: (2025)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
por: Kaudan, Chirag, et al.
Publicado: (2026)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
por: Marica, Edina, et al.
Publicado: (2026)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Structural Parameterization of Steiner Tree Packing
por: Hastrich, Niko, et al.
Publicado: (2025)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
por: Wang, Xin, et al.
Publicado: (2025)

Customizable Contraction Hierarchies -- A Survey
por: Bläsius, Thomas, et al.
Publicado: (2025)

Maintaining Routing Structures under Deletions via Self-Pruning
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

A Faster Algorithm for Independent Cut
por: Chernyshev, Vsevolod, et al.
Publicado: (2025)

Better coloring of 3-colorable graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
por: Kumar, Nikhil, et al.
Publicado: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
por: Kumar, Nikhil, et al.
Publicado: (2025)

Backdoors for Quantified Boolean Formulas
por: Eriksson, Leif, et al.
Publicado: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

Realizing temporal graphs from fastest travel times
por: Klobas, Nina, et al.
Publicado: (2023)