Cover Image

Maximal Clique Enumeration with Hybrid Branching and Early Termination

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Kaixin, Yu, Kaiqiang, Long, Cheng
Format:	Preprint
Published:	2024
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
by: Wang, Kaixin, et al.
Published: (2023)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
by: Wang, Kaixin, et al.
Published: (2026)

Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
by: Yang, Kewu, et al.
Published: (2026)

Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
by: Xia, Hongbo, et al.
Published: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
by: Yu, Kaiqiang, et al.
Published: (2025)

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
by: Wu, Yanping, et al.
Published: (2024)

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

MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
by: Ye, Xiaowei, et al.
Published: (2026)

Temporal $k$-Core Query, Revisited
by: Liu, Yinyu, et al.
Published: (2025)

DIST: Efficient k-Clique Listing via Induced Subgraph Trie
by: Nam, Yehyun, et al.
Published: (2025)

Maximum $k$-Plex Search: An Alternated Reduction-and-Bound Method
by: Gao, Shuohao, et al.
Published: (2024)

DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
by: Chatzakis, Manos, et al.
Published: (2025)

Ranked Enumeration for Database Queries
by: Tziavelis, Nikolaos, et al.
Published: (2024)

Ranked Enumeration of Conjunctive Query Results
by: Deep, Shaleen, et al.
Published: (2019)

No Cliques Allowed: The Next Step Towards BDD/FC Conjecture
by: Larroque, Lucas, et al.
Published: (2026)

Efficient Antagonistic k-plex Enumeration in Signed Graphs
by: Xu, Lantian, et al.
Published: (2024)

Spanning Tree-based Query Plan Enumeration
by: Izenov, Yesdaulet, et al.
Published: (2024)

Parallelizing Maximal Clique Enumeration on GPUs
by: Almasri, Mohammad, et al.
Published: (2022)

Towards Efficient Random-Order Enumeration for Join Queries
by: Chen, Pengyu, et al.
Published: (2025)

KnobCF: Uncertainty-aware Knob Tuning
by: Yan, Yu, et al.
Published: (2024)

Efficient Query Rewrite Rule Discovery via Standardized Enumeration and Learning-to-Rank(extend)
by: Zhang, Yuan, et al.
Published: (2026)

Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers
by: Fejza, Amela, et al.
Published: (2023)

DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph
by: Yin, Ziqi, et al.
Published: (2025)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
by: Bringmann, Karl, et al.
Published: (2026)

Distinctiveness Maximization in Datasets Assemblage
by: Wang, Tingting, et al.
Published: (2024)

Updateable Data-Driven Cardinality Estimator with Bounded Q-error
by: Li, Yingze, et al.
Published: (2024)

BranchBench: Aligning Database Branching with Agentic Demands
by: Ang, Elaine, et al.
Published: (2026)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

E2E: Efficient Filtered AKNN Search via Adaptive Termination
by: Xia, Wenxuan, et al.
Published: (2026)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
by: Kenig, Batya, et al.
Published: (2024)

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

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
by: Bringmann, Karl, et al.
Published: (2022)

MSO-Enumeration Over SLP-Compressed Unranked Forests
by: Lohrey, Markus, et al.
Published: (2024)

CONCERTO: Complex Query Execution Mechanism-Aware Learned Cost Estimation
by: Zhang, Kaixin, et al.
Published: (2024)

DistJoin: A Decoupled Join Cardinality Estimator based on Adaptive Neural Predicate Modulation
by: Zhang, Kaixin, et al.
Published: (2025)

Trajectory-Driven Multi-Product Influence Maximization in Billboard Advertising
by: Ali, Dildar, et al.
Published: (2026)

Will My Favorite Chases Terminate if Evaluating Conjunctive Queries Does? One Does Not Simply Decide This
by: Larroque, Lucas, et al.
Published: (2026)

O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
by: Lin, Qi, et al.
Published: (2026)

Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
by: Riveros, Cristian, et al.
Published: (2024)

Chase Termination Beyond Polynomial Time
by: Hanisch, Philipp, et al.
Published: (2024)