Less is More: Faster Maximum Clique Search by Work-Avoidance

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vandierendonck, Hans
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Performance
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Optimizing Locality of Graph Transposition on Modern Architectures
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)

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

Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026)

FRSZ2 for In-Register Block Compression Inside GMRES on GPUs
by: Grützmacher, Thomas, et al.
Published: (2024)

Virtual-Memory Powersort
by: Moltmann, Finn, et al.
Published: (2026)

Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)

Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)

Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
by: Luo, Chunyu, et al.
Published: (2024)

Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
by: Laso, Ruben, et al.
Published: (2025)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
by: Chen, Yuan, et al.
Published: (2025)

PHast -- Perfect Hashing made fast
by: Beling, Piotr, et al.
Published: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)

bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers
by: Guzmán, Benjamín
Published: (2026)

Revisiting Forest Proximities via Sparse Leaf-Incidence Kernels
by: Aumon, Adrien, et al.
Published: (2026)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
by: Saak, Jens, et al.
Published: (2023)

RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
by: Dehghankar, Mohsen, et al.
Published: (2026)

Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2023)

Faster Cycle Detection in the Congested Clique
by: Censor-Hillel, Keren, et al.
Published: (2024)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
by: Kwok, Shawxing
Published: (2025)

Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
by: Valko, Danila, et al.
Published: (2025)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
by: Ferreira, Miguel, et al.
Published: (2025)

The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)

On the Fair Comparison of Optimization Algorithms in Different Machines
by: Arza, Etor, et al.
Published: (2023)

Don't Persist All : Efficient Persistent Data Structures
by: Mahapatra, Pratyush, et al.
Published: (2019)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
by: Jin, Mingming, et al.
Published: (2023)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
by: Jin, Ce, et al.
Published: (2024)

No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
by: Motiwala, Yusuf
Published: (2025)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)

VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
by: Cannizzo, Fabio
Published: (2023)

TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)

QR factorization of ill-conditioned tall-and-skinny matrices on distributed-memory systems
by: Mijić, Nenad, et al.
Published: (2024)

Competitive Online Optimization under Inventory Constraints
by: Lin, Qiulin, et al.
Published: (2019)

DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)

Concurrent Deterministic Skiplist and Other Data Structures
by: Sasidharan, Aparna
Published: (2023)

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)