16 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DS2024
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
Lijun Chang
The concept of -defective clique, a relaxation of clique by allowing up-to missing edges, has been receiving increasing interests recently. Although the problem of finding t…
cs.DS2023★ 16 cited
Efficient Maximum -Defective Clique Computation with Improved Time Complexity
Lijun Chang
-defective cliques relax cliques by allowing up-to missing edges from being a complete graph. This relaxation enables us to find larger near-cliques and has applications in…