Comparisons in Hoare's Find Algorithm
- 期刊名称Combinatorics, Probability and Computing
- 作者KIRSCHENHOFER, PETER; PRODINGER, HELMUT
- 卷第7卷
- 期第1期
- 印刷ISSN0963-5483
- 文件大小189.62KB
- 发表时间1998-3
- DOI10.1017/s0963548397003325
- 页码111-120
Ramsey-nice families of graphsAharoni, Ron; Alon, Noga; Amir, Michal; Haxell, Penny; Hefetz, Dan; Jiang, Zilin; Kronenberg, Gal; Naor, Alon · European Journal of Combinatorics · 2018
A fast and simple randomized parallel algorithm for the maximal independent set problemNoga Alon; László Babai; Alon Itai · 1986
Degrees and choice numbersNoga Alon · 2000
Acyclic edge colorings of graphsNoga Alon; Benny Sudakov; Ayal Zaks · 2001
Induced subgraphs of prescribed sizeNoga Alon; Michael Krivelevich; Benny Sudakov · 2003
Large induced forests in sparse graphsNoga Alon; Dhruv Mubayi; Robin Thomas · 2001
Independent sets in tensor graph powersNoga Alon; Eyal Lubetzky · 2007
Subdivided graphs have linear ramsey numbersNoga Alon · 1994
Quasirandom GroupsGOWERS, W. T. · Combinatorics, Probability and Computing · 2008
Paths, Stars and the Number ThreeReed, Bruce · Combinatorics, Probability and Computing · 1996
Enumerating Contingency Tables via Random PermanentsBARVINOK, ALEXANDER · Combinatorics, Probability and Computing · 2008
Component Games on Regular GraphsHOD, RANI; NAOR, ALON · Combinatorics, Probability and Computing · 2014
Weakly 3-Connected GraphsWAGNER, DONALD K. · Combinatorics, Probability and Computing · 2006
On the Strong Chromatic NumberHAXELL, P. E. · Combinatorics, Probability and Computing · 2004
Colouring Random Regular GraphsSHI, LINGSHENG; WORMALD, NICHOLAS · Combinatorics, Probability and Computing · 2007
A Graph-Grabbing GameMICEK, PIOTR; WALCZAK, BARTOSZ · Combinatorics, Probability and Computing · 2011