A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. A k-track layout of a graph consists of a vertex kcolouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The queue-numbe...

decreasing qualitative aspects of residential environments is a real problem in recent public housing of kerman. this article is concentrated on surveying the impact of in-between spaces on residential environments quality (req), to evaluate different kinds of it and to determine interrelation of two main components: residents individual characteristics and characteristics of in-between spaces....

The “Silicon Valley” of India, Bengaluru is one the fastest growing cities, with many middle-class residents fruits and vegetables in their private spaces. This kind Localized food systems (LFS) has been considered not only for obtaining mental pleasure health consciousness, but also home consumption. outlook study examined honey bee diversity possibilities integrating different bees urban agri...

in this paper, the rolling force and reduction ratio have been investigated in multilayer strip rolling. for this purpose, two different set of multilayers have been selected which are al/st/al and cu/al/cu layouts. at first, the validation of the numerical analysis was performed by using an experimental test. after validation of the numerical results, two set of multilayer layouts were simulat...

• influences due to handling problems, distractions from environment or no unifying screen resolution. • participants might be used to TRA (a few trials of level 1 to 3 participants provide evidence) Future Work: • compare TRA layouts with layouts supporting 1/4SHPEDs [4] • with short “breaks" between serving graphs we may use the same graph in both models • investigate other stub sizes and mor...

In the design of railway track layouts, there are only a small number of geometric configurations that are used in practice, and a number of constraints as to how those configurations can be fitted together to create a whole layout. In order to solve these problems, we construct a Haskell combinator library. The library has been used for the design of real-world track layouts.

This paper describes a new approach to specifying graphical layouts of arbitrary objects, which is based on a TEXlike notation. Our simplest scheme offers specifications similar to TEX’s box-and-glue metaphor. Size and position of boxes and glue can be specified by constraints. Advantages of this TEX-like formalism are its expressiveness, user-predictable layouts, and efficient implementation s...

Linear layout of graphs/digraphs is one of the classical and important optimization problems that have many practical applications. Recently Tamaki proposed an O(mn)-time and O(n)space algorithm for testing whether the pathwidth (or vertex separation) of a given digraph with n vertices and m edges is at most k. In this paper, we show that linear layout of digraphs with an objective function suc...

We propose a new graph layout method based on a modification of the t-distributed Stochastic Neighbor Embedding (t-SNE) dimensionality reduction technique. Although t-SNE is one of the best techniques for visualizing high-dimensional data as 2D scatterplots, t-SNE has not been used in the context of classical graph layout. We propose a new graph layout method, tsNET, based on representing a gra...

Classical ancestor trees, descendant trees, Hourglass charts, and their visual variants such as node-link diagrams or fan charts are suitable for assessment of people’s relationships when one is focused on a particular person (the so-called main person) and his/her direct ancestors and descendants. Such tree-based representations miss a broader context of relationships and do not allow quick as...