On the average-case complexity of parameterized clique
The k -Clique problem is a fundamental combinatorial problem that plays a prominent role in classical as well as in parameterized complexity theory. It is among the most well-known NP-complete and W-complete problems. Moreover, its average-case complexity analysis has created a long thread of res...
|Published in:||Theoretical computer science : the journal of the EATCS, Vol. 576 (2015), p. 18-29|
|Other Involved Persons:||;|
|QR Code:||Show QR Code|