Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{2306238,
author = {Hliněný, Petr and Masařík, Tomáš},
address = {Switzerland},
booktitle = {Graph Drawing 2023},
doi = {http://dx.doi.org/10.1007/978-3-031-49272-3_8},
edition = {14465},
editor = {Bekos, M.A., Chimani, M.},
keywords = {Crossing Number; Planarity; Thickness; Fixed-parameter Tractability},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Switzerland},
isbn = {978-3-031-49271-6},
pages = {110-123},
publisher = {Springer, Cham},
title = {Minimizing an Uncrossed Collection of Drawings},
year = {2023}
}
TY - JOUR
ID - 2306238
AU - Hliněný, Petr - Masařík, Tomáš
PY - 2023
TI - Minimizing an Uncrossed Collection of Drawings
PB - Springer, Cham
CY - Switzerland
SN - 9783031492716
KW - Crossing Number
KW - Planarity
KW - Thickness
KW - Fixed-parameter Tractability
N2 - In this paper, we introduce the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is useful for graph visualization. We propose investigating a property where each edge is not crossed in at least one drawing in the collection. We call such collection uncrossed. This property is motivated by a quintessential problem of the crossing number, where one asks for a drawing where the number of edge crossings is minimum. Indeed, if we are allowed to visualize only one drawing, then the one which minimizes the number of crossings is probably the neatest for the first orientation. However, a collection of drawings where each highlights a different aspect of a graph without any crossings could shed even more light on the graph’s structure. We propose two definitions. First, the uncrossed number, minimizes the number of graph drawings in a collection, satisfying the uncrossed property. Second, the uncrossed crossing number, minimizes the total number of crossings in the collection that satisfy the uncrossed property. For both definitions, we establish initial results. We prove that the uncrossed crossing number is NP-hard, but there is an algorithm parameterized by the solution size.
ER -
HLINĚNÝ, Petr a Tomáš MASAŘÍK. Minimizing an Uncrossed Collection of Drawings. Online. In Bekos, M.A., Chimani, M. \textit{Graph Drawing 2023}. 14465. vyd. Switzerland: Springer, Cham, 2023, s.~110-123. ISBN~978-3-031-49271-6. Dostupné z: https://dx.doi.org/10.1007/978-3-031-49272-3\_{}8.
|
