Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Journal of Graph Algorithms and Applications, Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019 , Tome 24 (2020) no. 4, pp. 573-601.

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

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph class for its maximum edge density, another parameter that is often considered in the literature is the size of the largest complete or complete bipartite graph belonging to it. Overcoming the limitations of standard combinatorial arguments, we present a technique to systematically generate all non-isomorphic topological representations of complete and complete bipartite graphs, taking into account the constraints of the specific class. As a proof of concept, we apply our technique to various beyond-planarity classes and achieve new tight bounds for the aforementioned parameter.
DOI : 10.7155/jgaa.00531
Keywords: Beyond planarity, Complete (bipartite) graphs, Generation of topological representations
@article{JGAA_2020_24_4_a2,
     author = {Patrizio Angelini and Michael Bekos and Michael Kaufmann and Thomas Schneck},
     title = {Efficient {Generation} of {Different} {Topological} {Representations} of {Graphs} {Beyond-Planarity}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {573--601},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2020},
     doi = {10.7155/jgaa.00531},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00531/}
}
TY  - JOUR
AU  - Patrizio Angelini
AU  - Michael Bekos
AU  - Michael Kaufmann
AU  - Thomas Schneck
TI  - Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
JO  - Journal of Graph Algorithms and Applications
PY  - 2020
SP  - 573
EP  - 601
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00531/
DO  - 10.7155/jgaa.00531
LA  - en
ID  - JGAA_2020_24_4_a2
ER  - 
%0 Journal Article
%A Patrizio Angelini
%A Michael Bekos
%A Michael Kaufmann
%A Thomas Schneck
%T Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
%J Journal of Graph Algorithms and Applications
%D 2020
%P 573-601
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00531/
%R 10.7155/jgaa.00531
%G en
%F JGAA_2020_24_4_a2
Patrizio Angelini; Michael Bekos; Michael Kaufmann; Thomas Schneck. Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. Journal of Graph Algorithms and Applications, 
							Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019
					, Tome 24 (2020) no. 4, pp. 573-601. doi : 10.7155/jgaa.00531. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00531/

Cité par Sources :