17 citations · 17 across the 3 of their papers we have counts for
1 paper · 1 filter
Weng-Long Chang, Qi Yu, Zhaokai Li +3
The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from…