Imagen de Portada

Speeding-up Graph Algorithms via Clique Partitioning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chavan, Akshar, Rabinia, Sanaz, Grosu, Daniel, Brocanelli, Marco
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Speeding‐Up Graph Algorithms via Clique Partitioning
por: Akshar Chavan, et al.
Publicado: (2026)

Engineering Algorithms for $\ell$-Isolated Maximal Clique Enumeration
por: D'Elia, Marco, et al.
Publicado: (2025)

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

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

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

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

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

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)

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

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

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

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

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

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

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

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

Balanced Substructures in Bicolored Graphs
por: Ardra, P. S., et al.
Publicado: (2024)

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

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

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)

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)

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

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

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
por: Gillman, David, et al.
Publicado: (2025)

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

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

Approximately Partitioning Vertices into Short Paths
por: Gong, Mingyang, et al.
Publicado: (2026)

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)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
por: Mosenzon, Ron
Publicado: (2025)

Unsplittable Multicommodity Flows in Outerplanar Graphs
por: Alemán-Espinosa, David, et al.
Publicado: (2025)