Results 1 to 10 of about 261,145 (232)
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +12 more sources
A Graph Layout Framework Combining t-Distributed Neighbor Retrieval Visualizer and Energy Models
IEEE Access, 2019 Graph layout investigates the structure of the graph in order to better obtain the information implied in the graph. To solve the shortcomings of dimension reduction layouts on local adjustment and the insufficiency of energy models to maintain the ...
Guangluan Xu +6 more
doaj +2 more sources
On Linear Layouts of Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj +4 more sources
Circular layout in the Graph Layout toolkit [PDF]
, 1997 The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and
Uğur Doğrusöz +2 more
openalex +2 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +4 more sources
Aesthetic Discrimination of Graph Layouts [PDF]
Journal of Graph Algorithms and Applications, 2019 This paper addresses the following basic question: given two layouts of the same graph, which one is more aesthetically pleasing? We propose a neural network-based discriminator model trained on a labeled dataset that decides which of two layouts has a higher aesthetic quality.
Tamara Mchedlidze +2 more
openalex +5 more sources
ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software [PDF]
PLoS ONE, 2014 Mathieu Jacomy, Tommaso Venturini
exaly +2 more sources
Spherical Layout for 3D Graph Visualization
Journal of Computer Science and Technology, 2007 The goal of this work was centered in the graph visualization. The hope is that the extra dimension would give, literally, more space, and that this would ease the problem of displaying large structures.
Martín Leonardo Larrea
doaj +2 more sources
Area-Universal Rectangular Layouts [PDF]
, 2009 A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design ...
Eppstein, David +3 more
core +12 more sources
International Journal for Simulation and Multidisciplinary Design Optimization, 2021 The design of the progressive die stamping process is optimized through minimizing the number of die stamping stations in the strip layout to reduce the die cost.
Aly Shady +3 more
doaj +1 more source