Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Reyan Ahmed"'
Autor:
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines (layers),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d39cb602b848139263af15022d36e4a2
http://arxiv.org/abs/2301.10872
http://arxiv.org/abs/2301.10872
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ab8287b311a7d310d45ad3374089b7f
https://doi.org/10.1007/978-3-031-22203-0_19
https://doi.org/10.1007/978-3-031-22203-0_19
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19ff0186fad82ed92f5f28e5739992ec
https://doi.org/10.1007/978-3-031-22203-0_23
https://doi.org/10.1007/978-3-031-22203-0_23
Publikováno v:
IEEE transactions on visualization and computer graphics. 28(6)
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::b73ea52d4abeeda66bce78e0294af65c
https://pubmed.ncbi.nlm.nih.gov/35230951
https://pubmed.ncbi.nlm.nih.gov/35230951
Publikováno v:
Theoretical Computer Science. 806:455-467
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9d46ab1c6cc7955f67f110aa33c06fa
https://doi.org/10.1016/j.tcs.2019.08.011
https://doi.org/10.1016/j.tcs.2019.08.011
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
WG
An additive \(+\beta \) spanner of a graph G is a subgraph which preserves distances up to an additive \(+\beta \) error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted graphs [Elkin et a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd04a4601ae13b86540d57805a1276eb
https://doi.org/10.1007/978-3-030-86838-3_28
https://doi.org/10.1007/978-3-030-86838-3_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d0fb7d194d8a231ef90c5f572dab94f
https://doi.org/10.1007/978-3-030-68766-3_1
https://doi.org/10.1007/978-3-030-68766-3_1
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
A spanner of a graph G is a subgraph H that approximately preserves shortest path distances in G. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner constructions can seamles
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2884ffe5ba158d47ef9a6738557a574
https://doi.org/10.1007/978-3-030-60440-0_32
https://doi.org/10.1007/978-3-030-60440-0_32
Autor:
Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Keaton Hamm, Richard Spence, Faryad Darabi Sahneh, Reyan Ahmed
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030340285
SEA²
SEA²
Given a weighted graph G(V, E) and \(t \ge 1\), a subgraph H is a t–spanner of G if the lengths of shortest paths in G are preserved in H up to a multiplicative factor of t. The subsetwise spanner problem aims to preserve distances in G for only a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8cf21fa1aa42351d03227f93db1445a
https://doi.org/10.1007/978-3-030-34029-2_35
https://doi.org/10.1007/978-3-030-34029-2_35
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing
Graph Drawing
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfd9977d2a09aa45cf62fc9d55b65517
https://doi.org/10.1007/978-3-030-35802-0_23
https://doi.org/10.1007/978-3-030-35802-0_23