Počet záznamov: 1
Antibandwidth of Complete k-ary trees
Názov Antibandwidth of Complete k-ary trees Spoluautori Calamoneri T. Török Ľubomír (Autor) SAVMATEM - Matematický ústav SAV Vrťo Imrich 1953 (Autor) SAVMATEM - Matematický ústav SAV Ďalší autori Massini A. (Autor) Zdroj.dok. Electronic Notes in Discrete Mathematics. vol. 24 (2006), p. 259-266 Jazyk dok. eng - angličtina Krajina NL - Holandsko Druh dok. rozpis článkov z periodík (rbx) Ohlasy JIANG, T. - MILLER, Z. - PRITIKIN, D. Separation numbers of trees. In THEORETICAL COMPUTER SCIENCE. ISSN 0304-3975, SEP 6 2009, vol. 410, no. 38-40, p. 3769-3781. Kazumasa, Aoki, Kyohei Kozawa, Yota Otachi, Kazuyuki Ukegawa, Koichi Yamayaki. On the path distance width of complete k-ary trees. In Kyoto University Research Information Repository (KURENAI), 2008, vol. 1599, p. 141-147. WANG, X.H. - WU, X.L. - DUMITRESCU, S. On explicit formulas for bandwidth and antibandwidth of hypercubes. In DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X, APR 28 2009, vol. 157, no. 8, p. 1947-1952. RODRIGUEZ-TELLO, E. - BETANCOURT, L.C. An improved memetic algorithm for the antibandwidth problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7401 LNCS, pp. 121-132. BEKOS, M. A. - KAUFMANN, M. - KOBOUROV, S. - VEERAMONI, S. A note on maximum differential coloring of planar graphs. In Journal of Discrete Algorithms. ISSN 1570-8667, 2014, vol. 29, c, p. 1-7. BEKOS, Michael A. - KAUFMANN, Michael - KOBOUROV, Stephen - VEERAMONI, Sankar. The Maximum k-Differential Coloring Problem. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE. ISSN 0302-9743, 2015, vol. 8939, p. 115-127. RODRIGUEZ-TELLO, Eduardo - ROMERO-MONSIVAIS, Hillel - RAMIREZ-TORRES, Gabriel - LARDEUX, Frederic. Tabu search for the cyclic bandwidth problem. In COMPUTERS & OPERATIONS RESEARCH. ISSN 0305-0548, 2015, vol. 57, p. 17-32. BEKOS, Michael A. - KAUFMANN, Michael - KOBOUROV, Stephen G. - STAVROPOULOS, Konstantinos - VEERAMONI, Sankar. The maximum k-differential coloring problem. In JOURNAL OF DISCRETE ALGORITHMS. ISSN 1570-8667, 2017, vol. 45, p. 35-53. Kategória ADEB - Vedecké práce v ostatných zahraničných časopisoch neimpaktovaných Kategória (od 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Typ výstupu článok Rok vykazovania 2006 
článok
rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore N rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2006 2005 0.193 Q4
Počet záznamov: 1