发布求助
文献互助 智能选刊 最新文献

International Symposium Graph Drawing and Network Visualization最新文献

筛选
英文 中文
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs 完备二部图的相互见证加布里埃尔图
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-09-02 DOI: 10.48550/arXiv.2209.01004
William J. Lenhart, G. Liotta
{"title":"Mutual Witness Gabriel Drawings of Complete Bipartite Graphs","authors":"William J. Lenhart, G. Liotta","doi":"10.48550/arXiv.2209.01004","DOIUrl":"https://doi.org/10.48550/arXiv.2209.01004","url":null,"abstract":". Let Γ be a straight-line drawing of a graph and let u and v be two vertices of Γ . The Gabriel disk of u, v is the disk having u and v as antipodal points. A pair (cid:104) Γ 0 , Γ 1 (cid:105) of vertex-disjoint straight-line drawings form a mutual witness Gabriel drawing when, for i = 0 , 1, any two vertices u and v of Γ i are adjacent if and only if their Gabriel disk does not contain any vertex of Γ 1 − i . We characterize the pairs (cid:104) G 0 , G 1 (cid:105) of complete bipartite graphs that admit a mutual witness Gabriel drawing. The characterization leads to a linear time testing algorithm. We also show that when at least one of the graphs in the pair (cid:104) G 0 , G 1 (cid:105) is complete k -partite with k > 2 and all partition sets in the two graphs have size greater than one, the pair does not admit a mutual witness Gabriel drawing.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Shooting Stars in Simple Drawings of Km, n 简图中的流星，n
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-09-02 DOI: 10.48550/arXiv.2209.01190
O. Aichholzer, Alfredo Garc'ia, I. Parada, B. Vogtenhuber, A. Weinberger
{"title":"Shooting Stars in Simple Drawings of Km, n","authors":"O. Aichholzer, Alfredo Garc'ia, I. Parada, B. Vogtenhuber, A. Weinberger","doi":"10.48550/arXiv.2209.01190","DOIUrl":"https://doi.org/10.48550/arXiv.2209.01190","url":null,"abstract":". Simple drawings are drawings of graphs in which two edges have at most one common point (either a common endpoint, or a proper crossing). It has been an open question whether every simple drawing of a complete bipartite graph K m,n contains a plane spanning tree as a subdrawing. We answer this question to the positive by showing that for every simple drawing of K m,n and for every vertex v in that drawing, the drawing contains a shooting star rooted at v , that is, a plane spanning tree containing all edges incident to v .","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114278529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Spherical Graph Drawing by Multi-dimensional Scaling 球面图形的多维缩放绘制
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-09-01 DOI: 10.48550/arXiv.2209.00191
Jacob Miller, Vahan Huroyan, S. Kobourov
{"title":"Spherical Graph Drawing by Multi-dimensional Scaling","authors":"Jacob Miller, Vahan Huroyan, S. Kobourov","doi":"10.48550/arXiv.2209.00191","DOIUrl":"https://doi.org/10.48550/arXiv.2209.00191","url":null,"abstract":". We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are employed instead of Euclidean distances. The resulting spherical stress function is optimized by means of stochastic gradient descent. Quantitative and qualitative evaluations demon-strate the scalability and effectiveness of the proposed method. We also show that some graph families can be embedded with lower distortion on the sphere, than in Euclidean and hyperbolic spaces.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127991007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Visibility Representations of Toroidal and Klein-bottle Graphs 环面图和克莱因瓶图的可见性表示
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-09-01 DOI: 10.48550/arXiv.2209.00576
T. Biedl
{"title":"Visibility Representations of Toroidal and Klein-bottle Graphs","authors":"T. Biedl","doi":"10.48550/arXiv.2209.00576","DOIUrl":"https://doi.org/10.48550/arXiv.2209.00576","url":null,"abstract":"In this paper, we study visibility representations of graphs that are embedded on a torus or a Klein bottle. Mohar and Rosenstiehl showed that any toroidal graph has a visibility representation on a flat torus bounded by a parallelogram, but left open the question whether one can assume a rectangular flat torus, i.e., a flat torus bounded by a rectangle. Independently the same question was asked by Tamassia and Tollis. We answer this question in the positive. With the same technique, we can also show that any graph embedded on a Klein bottle has a visibility representation on the rectangular flat Klein bottle.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131668022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Rique-Number of Graphs 图的rique数
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-09-01 DOI: 10.48550/arXiv.2209.00424
M. Bekos, S. Felsner, P. Kindermann, S. Kobourov, Jan Kratochvíl, Ignaz Rutter
{"title":"The Rique-Number of Graphs","authors":"M. Bekos, S. Felsner, P. Kindermann, S. Kobourov, Jan Kratochvíl, Ignaz Rutter","doi":"10.48550/arXiv.2209.00424","DOIUrl":"https://doi.org/10.48550/arXiv.2209.00424","url":null,"abstract":"We continue the study of linear layouts of graphs in relation to known data structures. At a high level, given a data structure, the goal is to find a linear order of the vertices of the graph and a partition of its edges into pages, such that the edges in each page follow the restriction of the given data structure in the underlying order. In this regard, the most notable representatives are the stack and queue layouts, while there exists some work also for deques. In this paper, we study linear layouts of graphs that follow the restriction of a restricted-input queue (rique), in which insertions occur only at the head, and removals occur both at the head and the tail. We characterize the graphs admitting rique layouts with a single page and we use the characterization to derive a corresponding testing algorithm when the input graph is maximal planar. We finally give bounds on the number of needed pages (so-called rique-number) of complete graphs.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Shape-Faithful Graph Drawings 形状忠实的图形绘图
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-08-30 DOI: 10.48550/arXiv.2208.14095
A. Meidiana, Seok-Hee Hong, P. Eades
{"title":"Shape-Faithful Graph Drawings","authors":"A. Meidiana, Seok-Hee Hong, P. Eades","doi":"10.48550/arXiv.2208.14095","DOIUrl":"https://doi.org/10.48550/arXiv.2208.14095","url":null,"abstract":"Shape-based metrics measure how faithfully a drawing D represents the structure of a graph G, using the proximity graph S of D. While some limited graph classes admit proximity drawings (i.e., optimally shape-faithful drawings, where S = G), algorithms for shape-faithful drawings of general graphs have not been investigated. In this paper, we present the first study for shape-faithful drawings of general graphs. First, we conduct extensive comparison experiments for popular graph layouts using the shape-based metrics, and examine the properties of highly shape-faithful drawings. Then, we present ShFR and ShSM, algorithms for shape-faithful drawings based on force-directed and stress-based algorithms, by introducing new proximity forces/stress. Experiments show that ShFR and ShSM obtain significant improvement over FR (Fruchterman-Reingold) and SM (Stress Majorization), on average 12% and 35% respectively, on shape-based metrics.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114708602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Unit-length Rectangular Drawings of Graphs 单位长度矩形图形
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-08-30 DOI: 10.48550/arXiv.2208.14142
Carlos Alegría-Galicia, G. D. Lozzo, G. Battista, Fabrizio Frati, Fabrizio Grosso, M. Patrignani
{"title":"Unit-length Rectangular Drawings of Graphs","authors":"Carlos Alegría-Galicia, G. D. Lozzo, G. Battista, Fabrizio Frati, Fabrizio Grosso, M. Patrignani","doi":"10.48550/arXiv.2208.14142","DOIUrl":"https://doi.org/10.48550/arXiv.2208.14142","url":null,"abstract":". A rectangular drawing of a planar graph G is a planar drawing of G in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter constraint is relaxed for the outer face. In this paper, we study rectangular drawings in which the edges have unit length. We show a complexity dichotomy for the problem of deciding the existence of a unit-length rectangular drawing, depending on whether the outer face must also be drawn as a rectangle or not. Specifically, we prove that the problem is NP -complete for biconnected graphs when the drawing of the outer face is not required to be a rectangle, even if the sought drawing must respect a given planar embedding, whereas it is polynomial-time solvable, both in the fixed and the variable embedding settings, if the outer face is required to be drawn as a rectangle.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115181308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Small Point-Sets Supporting Graph Stories 支持图故事的小点集
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-08-30 DOI: 10.48550/arXiv.2208.14126
G. Battista, W. Didimo, L. Grilli, Fabrizio Grosso, Giacomo Ortali, M. Patrignani, Alessandra Tappini
{"title":"Small Point-Sets Supporting Graph Stories","authors":"G. Battista, W. Didimo, L. Grilli, Fabrizio Grosso, Giacomo Ortali, M. Patrignani, Alessandra Tappini","doi":"10.48550/arXiv.2208.14126","DOIUrl":"https://doi.org/10.48550/arXiv.2208.14126","url":null,"abstract":". In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time ω , called viewing window. At any time, the user can see only the drawing of the graph induced by the vertices in the viewing window and this determines a sequence of drawings. For readability, we require that all the drawings of the sequence are planar. For preserving the user’s mental map we require that when a vertex or an edge is drawn, it has the same drawing for its entire life. We study the problem of drawing the entire sequence by mapping the vertices only to ω + k given points, where k is as small as possible. We show that: ( i ) The problem does not depend on the specific set of points but only on its size; ( ii ) the problem is NP -hard and is FPT when parameterized by ω + k ; ( iii ) there are families of graph stories that can be drawn with k = 0 for any ω , while for k = 0 and small values of ω there are families of graph stories that can be drawn and others that cannot; ( iv ) there are families of graph stories that cannot be drawn for any fixed k and families of graph stories that require at least a certain k .","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129902561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Strictly-Convex Drawings of 3-Connected Planar Graphs 三连通平面图形的严格凸绘图
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-08-29 DOI: 10.48550/arXiv.2208.13388
M. Bekos, Martin Gronemann, Fabrizio Montecchiani, A. Symvonis
{"title":"Strictly-Convex Drawings of 3-Connected Planar Graphs","authors":"M. Bekos, Martin Gronemann, Fabrizio Montecchiani, A. Symvonis","doi":"10.48550/arXiv.2208.13388","DOIUrl":"https://doi.org/10.48550/arXiv.2208.13388","url":null,"abstract":"Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n^2) times O(n^2)$, as shown by B'{a}r'{a}ny and Rote by means of a sophisticated technique based on perturbing (non-strictly) convex drawings. Unfortunately, the hidden constants in such area bound are in the $10^4$ order. We present a new and easy-to-implement technique that yields strictly-convex straight-line planar drawings of $3$-connected planar graphs on an integer grid of size $2(n-1) times (5n^3-4n^2)$.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116640911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings 论时间与空间:图结构与时间编码的实验研究
International Symposium Graph Drawing and Network Visualization Pub Date : 2022-08-29 DOI: 10.48550/arXiv.2208.13716
V. Filipov, Alessio Arleo, M. Bögl, S. Miksch
{"title":"On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings","authors":"V. Filipov, Alessio Arleo, M. Bögl, S. Miksch","doi":"10.48550/arXiv.2208.13716","DOIUrl":"https://doi.org/10.48550/arXiv.2208.13716","url":null,"abstract":"Dynamic networks reflect temporal changes occurring to the graph's structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visualization along two major dimensions: the network structural and temporal representation. Significant research has been conducted evaluating the benefits and drawbacks of different structural representations for static graphs, however, few extend this comparison to a dynamic network setting. We conduct a study where we assess the participants' response times, accuracy, and preferences for different combinations of the graph's structural and temporal representations on typical dynamic network exploration tasks, with and without support of common interaction methods. Our results suggest that matrices provide better support for tasks on lower-level entities and basic interactions require longer response times while increasing accuracy. Node-link with auto animation proved to be the quickest and most accurate combination overall, while animation with playback control the most preferred temporal encoding.","PeriodicalId":159831,"journal":{"name":"International Symposium Graph Drawing and Network Visualization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126537005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书