Imagen de Portada

On $k$-connectivity oracles in $k$-connected graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Nutov, Zeev
Formato:	Preprint
Publicado:	2026
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

Improved bicriteria approximation for $k$-edge-connectivity
por: Nutov, Zeev
Publicado: (2025)

Bicriteria approximation for $k$-edge-connectivity
por: Nutov, Zeev, et al.
Publicado: (2025)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
por: Nutov, Zeev
Publicado: (2022)

Tight analysis of the primal-dual method for edge-covering pliable set families
por: Nutov, Zeev
Publicado: (2025)

Improved approximation ratio for covering pliable set families
por: Nutov, Zeev
Publicado: (2024)

A tight example for approximation ratio 5 for covering small cuts by the primal-dual method
por: Nutov, Zeev
Publicado: (2025)

Approximation and parameterized algorithms for covering disjointness-compliable set families
por: Nutov, Zeev, et al.
Publicado: (2025)

On connections between k-coloring and Euclidean k-means
por: Aman, Enver, et al.
Publicado: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
por: Xiao, Chenglong, et al.
Publicado: (2024)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
por: Mukhopadhyay, Asish, et al.
Publicado: (2024)

Dynamic framework for edge-connectivity maintenance of simple graphs
por: Wrobel, Blazej
Publicado: (2026)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

Testing $C_k$-freeness in bounded-arboricity graphs
por: Eden, Talya, et al.
Publicado: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
por: Daga, Mohit
Publicado: (2025)

On 2-strong connectivity orientations of mixed graphs and related problems
por: Georgiadis, Loukas, et al.
Publicado: (2023)

New approximate distance oracles and their applications
por: Kadria, Avi, et al.
Publicado: (2025)

Spectral partitioning of graphs into compact, connected regions
por: Davies, Ewan, et al.
Publicado: (2025)

Dynamic algorithms for k-center on graphs
por: Cruciani, Emilio, et al.
Publicado: (2023)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
por: Jaberi, Raed, et al.
Publicado: (2024)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
por: Ganczorz, Adam, et al.
Publicado: (2025)

Parameterized algorithms for $k$-Inversion
por: Antony, Dhanyamol, et al.
Publicado: (2026)

On Parallel $k$-Center Clustering
por: Coy, Sam, et al.
Publicado: (2023)

On Constrained and k Shortest Paths
por: Bendahi, Abderrahim, et al.
Publicado: (2024)

Time-Optimal $k$-Server
por: Frei, Fabian, et al.
Publicado: (2025)

Computing k-mers in Graphs
por: Alanko, Jarno N., et al.
Publicado: (2025)

Colorful Priority $k$-Supplier
por: Chekuri, Chandra, et al.
Publicado: (2024)

Structural Parameterizations of $k$-Planarity
por: Gima, Tatsuya, et al.
Publicado: (2025)

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

The connectivity carcass of a vertex subset in a graph: both odd and even case
por: Baswana, Surender, et al.
Publicado: (2025)

Hybrid k-Clustering: Blending k-Median and k-Center
por: Fomin, Fedor V., et al.
Publicado: (2024)

Randomized $k$-server in polynomial time
por: Coester, Christian, et al.
Publicado: (2026)

Dynamic k-center clustering with lifetimes
por: Moretti, Simone, et al.
Publicado: (2026)

Fault-tolerant $k$-Supplier with Outliers
por: Chakrabarty, Deeparnab, et al.
Publicado: (2023)

Local Search k-means++ with Foresight
por: Conrads, Theo, et al.
Publicado: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
por: Leonhardt, Alexander, et al.
Publicado: (2024)

Optimal $k$-Secretary with Logarithmic Memory
por: Qiao, Mingda, et al.
Publicado: (2025)

Fully Dynamic Euclidean k-Means
por: Bhattacharya, Sayan, et al.
Publicado: (2025)

Faster Combinatorial k-Clique Algorithms
por: Abboud, Amir, et al.
Publicado: (2024)

The $k$-Fold Matroid Secretary Problem
por: Gujjar, Rishi, et al.
Publicado: (2025)