https://opendata.uni-kiel.de/receive/fdr_mods_00000264 https://opendata.uni-kiel.de/servlets/MCRFileNodeServlet/fdr_derivate_00000268/IVAPP22-quantitative-analysis.zip https://opendata.uni-kiel.de/rsc/thumbnail/fdr_mods_00000264.png 2025-08-01 mixed material database SCCharts Model Order Pre-Sorting Evaluation Data This dataset contains evaluation results of subgraphs of various SCCharts models (which are not included in this dataset) for model order pre-sorting together with model order as a metric and the resulting edge crossings and order violations. 10.57892/100-264 en 004 his Host institution aut Author Domrös, Sören Domrös Sören 0000-0002-8011-8484 1201693225 570157704198344440006 2021-09-21 2021-10-06 Model Order Graphenzeichnen Kiel 10.122590409508845 54.33887034725194 The dataset contains a ods file with all results for all used model order crossing minimization strategies, as well as the log files from which the data is derived. The ods file contains the used SCCharts models identified by file path of the generated ELK XML file such that the names point to the source SCChart (which cannot be provided). Each sheet in the ods file analyzes all separate graph problems in each SCChart collecting the following data: <_v: Node order violations <_p: Port order violations Cf?: X marks subgraphs with conflicting node and egde order, T marks trivial problems These values are collected for the following mdel order crossing minimization strategies and configurations: NE: No pre-sorting while counting order violations based on the edge pre-sorting. E: Only pre-sorting by edge order and normal crossing minimization. EP: Same as EP0.01 EV: Same as EV0.01 EVP: Same as EVP 0.01 N: No pre-sorting while counting order violations based on the node and edge pre-sorting. V: Only pre-sorting by node and edge order and normal crossing minimization. VP: Same as VP0.01 VV: Same as VV0.01 VVP: Same as VVP0.01 EP0.01: Pre-sorting by edge order using edge order violations as a metric weighted as 0.01 of an edge crossing. EP0.1: Pre-sorting by edge order using edge order violations as a metric weighted as 0.1 of an edge crossing. EP0.5: Pre-sorting by edge order using edge order violations as a metric weighted as 0.5 of an edge crossing. EP1: Pre-sorting by edge order using edge order violations as a metric weighted same as an edge crossing. EP10: Pre-sorting by edge order using edge order violations as a metric weighted 10 times as important as an edge crossing. EP100: Pre-sorting by edge order using edge order violations as a metric weighted 100 times as important as an edge crossing. EV0.01: Pre-sorting by edge order using node order violations as a metric weighted as 0.01 of an edge crossing. EV0.1: Pre-sorting by edge order using node order violations as a metric weighted as 0.1 of an edge crossing. EV0.5: Pre-sorting by edge order using node order violations as a metric weighted as 0.5 of an edge crossing. EV1: Pre-sorting by edge order using node order violations as a metric weighted same as an edge crossing. EV10: Pre-sorting by edge order using node order violations as a metric weighted 10 times as important as an edge crossing. EV100: Pre-sorting by edge order using node order violations as a metric weighted 100 times as important as an edge crossing. EVP0.01: Pre-sorting by edge order using edge and node order violations as a metric weighted as 0.01 of an edge crossing. EVP0.1: Pre-sorting by edge order using edge and node order violations as a metric weighted as 0.1 of an edge crossing. EVP0.5: Pre-sorting by edge order using edge and node order violations as a metric weighted as 0.5 of an edge crossing. EVP1: Pre-sorting by edge order using edge and node order violations as a metric weighted same as an edge crossing. EVP10: Pre-sorting by edge order using edge and node order violations as a metric weighted 10 times as important as an edge crossing. EVP100: Pre-sorting by edge order using edge and node order violations as a metric weighted 100 times as important as an edge crossing. VVP0.01: Pre-sorting by node and edge order using edge and node order violations as a metric weighted as 0.01 of an edge crossing. VP0.1: Pre-sorting by node and edge order using edge and node order violations as a metric weighted as 0.1 of an edge crossing. VP0.5: Pre-sorting by node and edge order using edge and node order violations as a metric weighted as 0.5 of an edge crossing. VP1: Pre-sorting by node and edge order using edge and node order violations as a metric weighted same as an edge crossing. VP10: Pre-sorting by node and edge order using edge and node order violations as a metric weighted 10 times as important as an edge crossing. VP100: Pre-sorting by node and edge order using edge and node order violations as a metric weighted 100 times as important as an edge crossing. VV0.01: Pre-sorting by node and edge order using node order violations as a metric weighted as 0.01 of an edge crossing. VV0.1: Pre-sorting by node and edge order using node order violations as a metric weighted as 0.1 of an edge crossing. VV0.5: Pre-sorting by node and edge order using node order violations as a metric weighted as 0.5 of an edge crossing. VV1: Pre-sorting by node and edge order using node order violations as a metric weighted same as an edge crossing. VV10: Pre-sorting by node and edge order using node order violations as a metric weighted 10 times as important as an edge crossing. VV100: Pre-sorting by node and edge order using node order violations as a metric weighted 100 times as important as an edge crossing. VP0.01: Pre-sorting by node and edge order using edge order violations as a metric weighted as 0.01 of an edge crossing. VP0.1: Pre-sorting by node and edge order using edge order violations as a metric weighted as 0.1 of an edge crossing. VP0.5: Pre-sorting by node and edge order using edge order violations as a metric weighted as 0.5 of an edge crossing. VP1: Pre-sorting by node and edge order using edgeorder violations as a metric weighted same as an edge crossing. VP10: Pre-sorting by node and edge order using edge order violations as a metric weighted 10 times as important as an edge crossing. VP100: Pre-sorting by node and edge order using edgeorder violations as a metric weighted 100 times as important as an edge crossing. edgeCrossingAll: Sums up and is used to compae all edge crossings from all different strategies Comparison: Marks which layouts have the same number of node and edge order violations using different selected strategies fdr_mods_00000264 https://opendata.uni-kiel.de/receive/fdr_mods_00000264