Number of the records: 1
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the n-cube
Title The same upper bound for both: the 2-page and the rectilinear crossing numbers of the n-cube Author Faria Luerbio Co-authors de Figueiredo Celina M.H. Richter R. Bruce Vrťo Imrich 1953 SAVMATEM - Matematický ústav SAV Source document Journal of graph theory. Vol. 83, no. 1 (2016), p. 19-33 Language eng - English Country US - United States of America URL URL link Document kind rozpis článkov z periodík (rbx) Citations BANNISTER, Michael J. - EPPSTEIN, David. Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In Journal of Graph Algorithms and Applications. ISSN 15261719, 2018-01-01, 22, 4, p. 577-606. Category ADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted) Category of document (from 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Type of document článok Year 2016 Registered in WOS Registered in SCOPUS Registered in CCC DOI 10.1002/jgt.21910 article
rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore A rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2016 2015 0.796 Q2 1.469 Q1
Number of the records: 1