Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Josef Reislhuber"'
Autor:
Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Christopher Auer, Daniel Neuwirth, Christian Bachmaier, Josef Reislhuber
Publikováno v:
Algorithmica. 83:3534-3535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e6399877971ec9e3c736fc2ea2d5e6
https://doi.org/10.1007/s00453-021-00874-z
https://doi.org/10.1007/s00453-021-00874-z
Autor:
Josef Reislhuber, Christian Bachmaier, Kathrin Hanauer, Franz J. Brandenburg, Andreas Gleiβner, Christopher Auer, Daniel Neuwirth
Publikováno v:
Algorithmica. 74:1293-1320
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time, and specialize 1-pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1548d442ff97d99d6b728366091f5985
https://doi.org/10.1007/s00453-015-0002-1
https://doi.org/10.1007/s00453-015-0002-1
Publikováno v:
Journal of Graph Algorithms and Applications. 19:67-86
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a pl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84e7ca1a5d5fc8fcc27a7706bdaa8855
https://doi.org/10.7155/jgaa.00347
https://doi.org/10.7155/jgaa.00347
Autor:
Christian Bachmaier, Daniel Neuwirth, Kathrin Hanauer, Josef Reislhuber, Franz J. Brandenburg
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cee46f39487d73e6f9a9ecbdc2194f8
Autor:
Andreas Gleißner, Franz J. Brandenburg, Josef Reislhuber, Christian Bachmaier, Christopher Auer
Publikováno v:
Journal of Graph Algorithms and Applications. 17:541-565
Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons and it maps edges to Jordan curves con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce20f6cd222d7ca8e7a3ba74efcd4b1a
https://doi.org/10.7155/jgaa.00303
https://doi.org/10.7155/jgaa.00303
Autor:
Kathrin Hanauer, Franz J. Brandenburg, Josef Reislhuber, Andreas Gleiβner, Christian Bachmaier, Daniel Neuwirth, Christopher Auer
Publikováno v:
Graph Drawing ISBN: 9783319038407
Graph Drawing
Graph Drawing
A graph is outer 1-planar o1p if it can be drawn in the plane such that all vertices are on the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time and specialize 1-planar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff94336fb03f6c3ed650517e5062ae86
https://doi.org/10.1007/978-3-319-03841-4_10
https://doi.org/10.1007/978-3-319-03841-4_10
Autor:
Andreas Gleißner, Josef Reislhuber, Franz J. Brandenburg, David Eppstein, Michael T. Goodrich, Kathrin Hanauer
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates 1-planarity. Maximal 1-planar graphs have at most 4n−8 edges. We show that there are sparse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a550b2d418933e17d401b0e0f8163f38
https://doi.org/10.1007/978-3-642-36763-2_29
https://doi.org/10.1007/978-3-642-36763-2_29
Autor:
Andreas Gleißner, Josef Reislhuber, Franz J. Brandenburg, Christopher Auer, Christian Bachmaier
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
Optical graph recognition (OGR) reverses graph drawing. A drawing transforms the topological structure of a graph into a graphical representation. Primarily, it maps vertices to points and displays them by icons and it maps edges to Jordan curves con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c3ae6f35b5ae47a90f8016e1fa0e50a
https://doi.org/10.1007/978-3-642-36763-2_47
https://doi.org/10.1007/978-3-642-36763-2_47