Zobrazeno 1 - 10
of 669
pro vyhledávání: '"Raftopoulou A"'
A linear layout of a graph $ G $ consists of a linear order $\prec$ of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), that is, two edges $ (v,w) $ and $ (x,y) $ with $ v \prec x \prec y \prec
Externí odkaz:
http://arxiv.org/abs/2305.16087
Publikováno v:
Journal of Shipping and Trade, Vol 9, Iss 1, Pp 1-23 (2024)
Abstract The purpose of this paper is to discuss the challenges that appear in maritime human resource management, in the face of the digitalized environment in maritime business, due to the diffusion of new technologies, such as big data analytics,
Externí odkaz:
https://doaj.org/article/d4815fa4feae42eb9022ff5414bb66ad
Autor:
Bekos, Michael A., Da Lozzo, Giordano, Frati, Fabrizio, Gronemann, Martin, Mchedlidze, Tamara, Raftopoulou, Chrysanthi N.
The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the top
Externí odkaz:
http://arxiv.org/abs/2208.13615
Autor:
Chaplick, Steven, Di Giacomo, Emilio, Frati, Fabrizio, Ganian, Robert, Raftopoulou, Chrysanthi N., Simonov, Kirill
We present an $O(n^2)$-time algorithm to test whether an $n$-vertex directed partial $2$-tree is upward planar. This result improves upon the previously best known algorithm, which runs in $O(n^4)$ time.
Comment: Appears in the Proceedings of th
Comment: Appears in the Proceedings of th
Externí odkaz:
http://arxiv.org/abs/2208.12548
Autor:
Chaplick, Steven, Di Giacomo, Emilio, Frati, Fabrizio, Ganian, Robert, Raftopoulou, Chrysanthi N., Simonov, Kirill
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an XP-algori
Externí odkaz:
http://arxiv.org/abs/2203.05364
Autor:
Skarlis, Charalampos, Papadopoulos, Vassilis, Raftopoulou, Sylvia, Mavragani, Clio P., Evangelopoulos, Maria-Eleftheria
Publikováno v:
In Journal of the Neurological Sciences 15 June 2024 461
Publikováno v:
2021 IEEE International Conference on Cyber Security and Resilience (CSR)
The rapid development of IoT applications and their use in various fields of everyday life has resulted in an escalated number of different possible cyber-threats, and has consequently raised the need of securing IoT devices. Collecting Cyber-Threat
Externí odkaz:
http://arxiv.org/abs/2109.04306
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs, the recogni
Externí odkaz:
http://arxiv.org/abs/2108.00665
A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimization goal is to determine the queue number of a graph, i.e., the minimum
Externí odkaz:
http://arxiv.org/abs/2106.08003
Autor:
Bekos, Michael A., Da Lozzo, Giordano, Griesbach, Svenja M., Gronemann, Martin, Montecchiani, Fabrizio, Raftopoulou, Chrysanthi
Publikováno v:
In Discrete Mathematics January 2024 347(1)