Imagen de Portada

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sun, Shengli, Xu, Peng, Jiang, Guanming, Yu, Philip S., Li, Yi
Formato:	Preprint
Publicado:	2025
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

String Indexing for Top-$k$ Close Consecutive Occurrences
por: Bille, Philip, et al.
Publicado: (2020)

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

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

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
por: Kosolobov, Dmitry, et al.
Publicado: (2021)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
por: Dai, Han, et al.
Publicado: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
por: Huang, Lingxiao, et al.
Publicado: (2022)

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
por: Peng, Pan, et al.
Publicado: (2025)

Space-Efficient k-Mismatch Text Indexes
por: Kociumaka, Tomasz, et al.
Publicado: (2025)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
por: Sawettamalya, Pachara, et al.
Publicado: (2025)

Compressed Index with Construction in Compressed Space
por: Kosolobov, Dmitry
Publicado: (2026)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

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

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
por: Peng, Pan, et al.
Publicado: (2026)

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

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

String Indexing with Compressed Patterns
por: Bille, Philip, et al.
Publicado: (2019)

Perfect Simulation of Las Vegas Algorithms via Local Computation
por: Fu, Xinyu, et al.
Publicado: (2023)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Optimal-Time Move Structure Construction
por: Brown, Nathaniel K., et al.
Publicado: (2026)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
por: Madani, Amirali, et al.
Publicado: (2025)

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
por: Bijoy, Adithya, et al.
Publicado: (2025)

Review of Three Algorithms That Build k-d Trees
por: Brown, Russell A.
Publicado: (2025)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
por: Ferdous, S M, et al.
Publicado: (2023)

Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs
por: Hu, Zhengding, et al.
Publicado: (2026)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

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

A Reduction-based Algorithm for the Clique Interdiction Problem
por: Zhu, Chenghao, et al.
Publicado: (2025)

Time-Optimal Construction of String Synchronizing Sets
por: Ellert, Jonas, et al.
Publicado: (2026)

Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
por: Nishimoto, Takaaki, et al.
Publicado: (2026)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
por: Kadria, Avi, et al.
Publicado: (2025)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
por: Gavva, Surya Teja, et al.
Publicado: (2025)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
por: Fischer, Nick, et al.
Publicado: (2026)

Faster Algorithm for Structured John Ellipsoid Computation
por: Cao, Yang, et al.
Publicado: (2022)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
por: la Tour, Max Dupré, et al.
Publicado: (2024)