Results 1 to 10 of about 262,244 (186)
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
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
Interactive Graph Layout of a Million Nodes
Informatics, 2016 Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs ...
Peng Mi +4 more
doaj +3 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-stack layout (respectively, \emphk-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 +5 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
Experimental analysis of the accessibility of drawings with few segments [PDF]
, 2017 The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges ...
Kindermann, Philipp +2 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
Linear Layouts of Complete Graphs [PDF]
, 2021 Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Felsner, S. +3 more
openaire +3 more sources
Graph drawing using tabu search coupled with path relinking. [PDF]
PLoS ONE, 2018 Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria.
Fadi K Dib, Peter Rodgers
doaj +1 more source
Prospects of room graph at ‘Seqina’ slum in Egypt
Ain Shams Engineering Journal, 2022 Major problem of fast sprawling slums in Egypt addresses the social study in details. Objective survey study on the micro room-level explores the social structure of building layout.
Ali Essam El Shazly
doaj +1 more source