Results 1 to 10 of about 24,958 (160)
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 +7 more sources
On Linear Layouts of Graphs [PDF]
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
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
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
RegionGraph: Region-Aware Graph-Based Building Reconstruction from Satellite Imagery [PDF]
Structural reconstruction helps infer the spatial relationships and object layouts in a scene, which is an essential computer vision task for understanding visual content.
Lei Li +5 more
doaj +2 more sources
Interactive Graph Layout of a Million Nodes
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 ...
Maoyuan Sun, Chris North, Peng Mi
exaly +3 more sources
On the perception of graph layouts
AbstractIn the field of software engineering, graph‐based models are used for a variety of applications. Usually, the layout of those graphs is determined at the discretion of the user. This article empirically investigates whether different layouts affect the comprehensibility or popularity of a graph and whether one can predict the perception of ...
Lisa Grabinger +2 more
openaire +1 more source
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]
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
The Perception of Graph Properties in Graph Layouts [PDF]
AbstractWhen looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms ...
Utkarsh Soni +5 more
openaire +2 more sources
Consistent graph layout for weighted graphs [PDF]
Summary form only given. In this paper, we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the graph. We introduce tree algorithms and show that they can be successful in solving the problem up to a certain precision.
Dana Vrajitoru, Jason DeBoni
openaire +1 more source

