Have a personal or library account? Click to login

Reconstruction of score sets

Acta Universitatis Sapientiae, Informatica
Volume 6 (2014): Issue 2 (December 2014)
By:
Open Access
|Jan 2015

References

  1. [1] G. Chartrand, L. Lesniak, J. Roberts, Degree sets for digraphs, Periodica Math. Hung., 7 (1976) 77-85. ⇒21210.1007/BF02019997
    Search in Google Scholar
  2. [2] T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms (third edition), The MIT Press/McGraw Hill, Cambridge/New York, 2009. ⇒216
    Search in Google Scholar
  3. [3] J. L. Gross, J. Yellen, P. Zhang, Handbook of Graph Theory, CRC Press, Boca Raton, FL, 2013. ⇒21010.1201/b16132
    Search in Google Scholar
  4. [4] M. Hager. On score sets for tournaments, Discrete Math., 58 (1986) 25-34. ⇒ 210, 21210.1016/0012-365X(86)90183-4
    Search in Google Scholar
  5. [5] A. Iványi, J. Elek, Degree sets of tournaments, Studia Univ. Babe，s-Bolyai, Informatica, 59 (2014) 150-164. ⇒210, 215, 223, 226
    Search in Google Scholar
  6. [6] A. Iványi, L. Lucz, T. Matuszka, G. Gombos, Score sets in multitournaments, I. Mathematical results, Annales Univ. Sci. Budapest., Rolando E¨otv¨os Nom., Sectio Comp., 40 (2013) 307-320. ⇒210, 214, 215, 223, 226, 228
    Search in Google Scholar
  7. [7] A. Iványi, B. M. Phong, On the unicity of the score sets of multitournaments, in: Fifth Conference on Mathematics and Computer Science (Debrecen, June 9-12, 2004), University of Debrecen, 2006, 10 pages. ⇒213
    Search in Google Scholar
  8. [8] A. Iványi, S. Pirzada, Comparison based ranking, in: ed. A. Iványi, Algorithms of Informatics, Vol. 3, mondAt, Vác, 2013, 1209-1258. ⇒211
    Search in Google Scholar
  9. [9] D. E. Knuth, The Art of Computer Programming, Volume 4A. Addison Wesley, Upper Saddle River, NJ, 2011. ⇒228
    Search in Google Scholar
  10. [10] H. H. Landau, On dominance relations and the structure of animal societies. III., Bull. Math. Biophysics, 15 (1953) 143-148. ⇒211, 212
    Search in Google Scholar
  11. [11] Q. Li, Some results and problems in graph theory, New York Academy of Science, 576 (1989) 336-343. ⇒214
    Search in Google Scholar
  12. [12] V. Petrović, On bipartite score sets, Zbornik Radova Prirodno-matematiˇckog Fakulteta Ser. Mat., Universitat u Novom Sadu, 13 (1983) 297-303. ⇒213
    Search in Google Scholar
  13. [13] S. Pirzada, A. Iványi, M. A. Khan, Score sets and kings, in ed. A. Iványi, Algorithms of Informatics, mondAt, Vác, 2013, 1337-1389. ⇒214
    Search in Google Scholar
  14. [14] S. Pirzada, T. A. Naikoo, On score sets in tournaments, Vietnam J. Math., 34 (2006) 157-161. ⇒212
    Search in Google Scholar
  15. [15] K. B. Reid, Score sets for tournaments, Congressus Numer., 21 (1978) 607-618. ⇒210, 212
    Search in Google Scholar
  16. [16] K. B. Reid, Tournaments: Scores, kings, generalizations and special topics, Congressus Numer., 115 (1996) 171-211. ⇒211, 212, 214
    Search in Google Scholar
  17. [17] K. Wayland, Bipartite score sets, Canadian Math. Bull., 26 (1983) 273-279. ⇒ 213
    Search in Google Scholar
  18. [18] T. X. Yao, On Reid conjecture of score sets for tournaments. Chinese Science Bull., 34 (1989) 804-808. ⇒210, 212, 213, 214
    Search in Google Scholar
DOI: https://doi.org/10.1515/ausi-2015-0005 | Journal eISSN: 2066-7760
Journal RSS Feed
Language: English
Page range: 210 - 229
Submitted on: Jun 28, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year
Keywords:
score set,
score sequence,
approximation algorithms,
Reid conjecture
Related subjects:
Computer sciences,
Computer sciences, other

© 2015 Antal Iványi, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 6 (2014): Issue 2 (December 2014)Next article