Learning permutations with exponential weights. (English)
J. Mach. Learn. Res. 10, 1705-1736 (2009).
1
Greedy rankings and arank numbers. (English)
Inf. Process. Lett. 109, No. 15, 825-827 (2009).
2
An on-line parallel algorithm for node ranking of trees. (English)
Hua, Arrems (ed.) et al., Algorithms and architectures for parallel processing. 9th international conference, ICA3PP 2009, Taipei, Taiwan, June 8‒11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03094-9/pbk). Lecture Notes in Computer Science 5574, 384-395 (2009).
3
On node ranking of complete $r$-partite graphs. (English)
J. Comb. Math. Comb. Comput. 67, 77-85 (2008).
4
A lower bound for on-line ranking number of a path. (English)
Discrete Math. 307, No. 11-12, 1347-1355 (2007).
5
A note on on-line ranking number of graphs. (English)
Czech. Math. J. 56, No. 2, 591-599 (2006).
6
On-line rankings of graphs. (English)
Discrete Math. 212, No.1-2, 141-147 (2000).
7
Start
Contact
Print
General Help
