The proceedings contain 59 papers. The topics discussed include: how can biclique covers help in matching problems;how can algorithms help in protecting our privacy;the Euclidean MST-ratio for bi-colored lattices;hole...
ISBN:
(纸本)9783959773430
The proceedings contain 59 papers. The topics discussed include: how can biclique covers help in matching problems;how can algorithms help in protecting our privacy;the Euclidean MST-ratio for bi-colored lattices;holes in convex and simple drawings;1-planar unit distance graphs;the density formula: one lemma to bound them all;partitioning complete geometric graphs on dense point sets into plane subgraphs;constrained outer-string representations;monotone arc diagrams with few Biarcs;the parameterized complexity of extending stack layouts;knowledge graph builder – constructing a graph from arbitrary text using an LLM;and evolutionary algorithms for one-sided bipartite crossing minimization.
This report describes the 31st Annual graphdrawing Contest, held in conjunction with the 32nd international symposium on graph drawing and network visualization (gd'24) at TU Wien, Vienna, Austria. The mission of...
详细信息
network analysis andvisualization are crucial for unraveling complex relationships across diverse fields, from social networks to biological systems. NodeXL is a versatile network analysis tool that supports a wide r...
详细信息
We present graph Harvester, a website for extracting graphs from illustrations in scientific papers. For every graph that has been extracted, graph Harvester queries the graph database House of graphs. If the graph is...
详细信息
graphvisualizations help with complex data analysis but often require expert knowledge to apply and configure advanced algorithms. yFiles, a diagramming SDK, bridges this gap by enabling developers to create interact...
详细信息
networkX is a well-established Python library for network analysis. With gdMetriX, we aim to extend the functionality of networkX and provide common quality metrics used in the field of graphdrawing, such as the numb...
详细信息
Information visualization tools are an essential component of many data-driven decision-making systems that rely on human feedback. The aim of this paper is to propose a novel research direction focused on fair visual...
详细信息
We present a deterministic n2+o(1)-time algorithm that approximates the crossing number of any graph G of order n up to an additive error of o(n4), as well as a randomized polynomial-time algorithm that constructs a d...
详细信息
Traditional implementations of the Sugiyama algorithm optimize aesthetic criteria such as the number of backward edges, edge length, or edge crossings. If we, however, utilize the model order, as provided e. g. by a t...
详细信息
We investigate force-directed graphdrawing techniques under the constraint that some nodes must be anchored to stay within a given polygonal region associated with it (i.e. some positional information is known). The ...
详细信息
暂无评论