Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Search results for: SPLIT
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
The Effect of University Campuses on the Modal Split of Polish Cities
PublicationThe article considers the effect Polish public universities have on the characteristics of urban traffic. The article describes how the public university community has changed over 25 years and its share in the urban population. The characteristics of the modal split in Polish university towns is given based on selected cases. The relation between the share of transport modes in the modal split and the size of towns or university...
-
M-Split Estimation in Laser Scanning Data Modeling
PublicationPublikacja traktuje o wykorzystaniu estymacji M-Split do modelowania danych pozyskanych w wyniku skaningu laserowego. Autorzy prezentują rozwiązanie w oparciu o detekcję krawędzi dwóch płaszczyzn.
-
Split-Beam Echosounder Data from Puck Bay
PublicationThe acoustic data was collected in 2018–2019 in the Bay of Puck in the seasons: autumn, winter, spring. The data was collected during the day and night using three split-beam echosounders with frequencies of 38 kHz, 120 kHz and 333 kHz at a designated study area not far from the city of Hel, while the ship was sailing. To ensure data quality, the echosounders were calibrated and passive noise was measured.
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
PublicationRekonstrukcja drzew ewolucji jest jednym z głównych celów w bioinformatyce. Drzewa filogenetyczne reprezentuje historię ewolucji i związki pokrewieństwa między różnymi gatunkami. W pracy proponujemy nową ogólną metodę określania odległości między nieukorzenionymi drzewami filogenetycznymi, szczególnie użyteczną dla dużych zbiorów gatunków. Następnie podajemy szczegółowe własności jednej metryki określonej przy użyciu tej metody...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
Publication -
The Port of Split international marine traffic emissions inventory
Publication -
Assessment of the Impact of Split Storage within Modular Multilevel Converter
Publication -
Comparative analysis of balancing of V6 engines with common- and split-pin crankshafts
PublicationAn analysis of balancing of V6 engines equipped with split-pin crankshafts with any cylinder bank angle based on the mathematical relations derived in the paper was carried out. A comparison of the quality of their balancing with engines equipped with common-pin crankshafts was also carried out. The bank angle ranges beneficial for balancing of moments of inertia forces in reciprocating motion were determined. A mathematical relation...