Results 261 to 270 of about 2,072,739 (293)
Some of the next articles are maybe not open access.
Graph Drawing via Gradient Descent, (GD)2
International Symposium Graph Drawing and Network Visualization, 2020Readability 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.
Abu Reyan Ahmed +4 more
semanticscholar +1 more source
The Multi-Dimensional Landscape of Graph Drawing Metrics
IEEE Pacific Visualization SymposiumAny graph drawing can be characterised by a range of computational aesthetic metrics. For example, a given drawing might be described as having eight crossings, a mean angular resolution of 0.34, and an edge orthogonality value of 0.72.
Gavin J. Mooney +3 more
semanticscholar +1 more source
2017
This chapter considers the concept of planar graph and its underlying theory. It begins with a discussion of the Three Houses and Three Utilities Problem and how it can be represented by a graph. It shows that solving the Three Houses and Three Utilities Problem is equivalent to the problem of determining whether the graph that represents it can be ...
Arthur Benjamin +2 more
openaire +1 more source
This chapter considers the concept of planar graph and its underlying theory. It begins with a discussion of the Three Houses and Three Utilities Problem and how it can be represented by a graph. It shows that solving the Three Houses and Three Utilities Problem is equivalent to the problem of determining whether the graph that represents it can be ...
Arthur Benjamin +2 more
openaire +1 more source
Tabu search tutorial. A Graph Drawing Application
TOP - An Official Journal of the Spanish Society of Statistics and Operations Research, 2021F. Glover, V. Campos, R. Martí
semanticscholar +1 more source
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Dagstuhl Reports, 2021R. Ganian +3 more
semanticscholar +1 more source
2009
Invited Talks.- Networks in Biology - From Identification, Analysis to Interpretation.- Graph Drawing for Security Visualization.- Papers.- Succinct Greedy Graph Drawing in the Hyperbolic Plane.- An Algorithm to Construct Greedy Drawings of Triangulations.- Crossing and Weighted Crossing Number of Near-Planar Graphs.- Cubic Graphs Have Bounded Slope ...
openaire +2 more sources
Invited Talks.- Networks in Biology - From Identification, Analysis to Interpretation.- Graph Drawing for Security Visualization.- Papers.- Succinct Greedy Graph Drawing in the Hyperbolic Plane.- An Algorithm to Construct Greedy Drawings of Triangulations.- Crossing and Weighted Crossing Number of Near-Planar Graphs.- Cubic Graphs Have Bounded Slope ...
openaire +2 more sources
Graph drawing by force‐directed placement
Software, Practice & Experience, 1991Thomas M. J. Fruchterman, E. Reingold
semanticscholar +1 more source
SIAM Journal on Discrete Mathematics, 1994
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source
Suppose that we have a 2-cell embedding of a graph \(G\) in an orientable surface \(S_ g\) of genus \(g\). The surface can be represented by the standard fundamental polygon that is a convex \((4g)\)-gon in the plane with its sides pairwise identified as \(a_ 1 b_ 1 a^ -_ 1 b^ - _ 1\cdots a_ g b_ g a^ -_ g b^ -_ g\).
openaire +1 more source
International Symposium Graph Drawing and Network Visualization
Daniel Archambault +5 more
semanticscholar +1 more source
Daniel Archambault +5 more
semanticscholar +1 more source