Crossing Numbers of Beyond-Planar Graphs Revisited
Journal of Graph Algorithms and Applications, Tome 26 (2022) no. 1, pp. 149-170.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden (edge) crossing configurations. A natural criterion for the quality of a drawing is the number of edge crossings. The question then arises whether beyond-planar drawings have a significantly larger crossing number than unrestricted drawings. Chimani et al. [GD'19] gave bounds for the ratio between the crossing number of three classes of beyond-planar graphs and the unrestricted crossing number. In this paper we extend their results to the main currently known classes of beyond-planar graphs characterized by forbidden edge configurations and answer several of their open questions.
DOI : 10.7155/jgaa.00586
Keywords: Crossing Numbers, Beyond Planarity, Crossing Ratios
@article{JGAA_2022_26_1_a8,
     author = {Nathan van Beusekom and Irene Parada and Bettina Speckmann},
     title = {Crossing {Numbers} of {Beyond-Planar} {Graphs} {Revisited}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {149--170},
     publisher = {mathdoc},
     volume = {26},
     number = {1},
     year = {2022},
     doi = {10.7155/jgaa.00586},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00586/}
}
TY  - JOUR
AU  - Nathan van Beusekom
AU  - Irene Parada
AU  - Bettina Speckmann
TI  - Crossing Numbers of Beyond-Planar Graphs Revisited
JO  - Journal of Graph Algorithms and Applications
PY  - 2022
SP  - 149
EP  - 170
VL  - 26
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00586/
DO  - 10.7155/jgaa.00586
LA  - en
ID  - JGAA_2022_26_1_a8
ER  - 
%0 Journal Article
%A Nathan van Beusekom
%A Irene Parada
%A Bettina Speckmann
%T Crossing Numbers of Beyond-Planar Graphs Revisited
%J Journal of Graph Algorithms and Applications
%D 2022
%P 149-170
%V 26
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00586/
%R 10.7155/jgaa.00586
%G en
%F JGAA_2022_26_1_a8
Nathan van Beusekom; Irene Parada; Bettina Speckmann. Crossing Numbers of Beyond-Planar Graphs Revisited. Journal of Graph Algorithms and Applications, Tome 26 (2022) no. 1, pp. 149-170. doi : 10.7155/jgaa.00586. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00586/

Cité par Sources :