119 citations · 207 across the 21 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.PR2012★ 3 cited
Analysis of an exhaustive search algorithm in random graphs and the n^{c\log n} -asymptotics
Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana +1
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual G_{n,p} -model where each possible edge appea…
math.CO2012★ 18 cited
Enumeration and asymptotics of restricted compositions having the same number of parts
Cyril Banderier, Pawel Hitczenko
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the numb…