Number of the records: 1
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
Title Various heuristic algorithms to minimise the two-page crossing numbers of graphs Author He Hongmei Co-authors Salagean Ana Mäkinen Erkki Vrťo Imrich 1953 SAVMATEM - Matematický ústav SAV Source document Open Computer Science. Vol. 5, no. 1 (2015), p. 22-40 Language eng - English Country DE - Germany Document kind rozpis článkov z periodík (rbx) Citations KLAWITTER, Jonathan - MCHEDLIDZE, Tamara. Heuristic Picker for Book Drawings. In GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016). ISSN 0302-9743, 2016, vol. 9801, p. 631-633. KLAWITTER, Jonathan - MCHEDLIDZE, Tamara - NÖLLENBURG, Martin. Experimental evaluation of book drawing algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2018, 10692 LNCS, p. 224-238. SCHAEFER, Marcus. The graph crossing number and its variants: A survey. In Electronic Journal of Combinatorics, 2018, vol. 1, dynamicSurveys, art. no. DS21. HERRÁN, Alberto - COLMENAR, J. Manuel - DUARTE, Abraham. An efficient metaheuristic for the K-page crossing number minimization problem. In Knowledge-Based Systems. ISSN 09507051, 2020-11-05, 207. Category ADEB - Scientific papers in other foreign journals not registered in Current Contents Connect without IF (non-impacted) Category of document (from 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Type of document článok Year 2015 article
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) 2015
Number of the records: 1