Analysis of an exhaustive search algorithm in random graphs and the $n^{c log n}$-asymptotics

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/41805

Title:	Analysis of an exhaustive search algorithm in random graphs and the $n^{c log n}$-asymptotics
Authors:	Banderier, Cyril Hwang, Hsien-Kuei Ravelomanana, Vlady Zacharovas, Vytas
URI:	http://ir.sinica.edu.tw/handle/201000000A/41805
Appears in Collections:	統計科學研究所

Show full item record

Last Week
1

Last month
0

checked on Dec 31, 2022

Check