BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
CTAD calibrates anomaly scores via optimal transport distance on empirical and K-means structural distributions of normal data, yielding consistent gains across 34 tabular datasets and seven detector types.
citing papers explorer
-
Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound
BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.
-
Calibrating Tabular Anomaly Detection via Optimal Transport
CTAD calibrates anomaly scores via optimal transport distance on empirical and K-means structural distributions of normal data, yielding consistent gains across 34 tabular datasets and seven detector types.