Results 81 to 90 of about 262,244 (186)
Persistent Homology Guided Force-Directed Graph Layouts
, 2019 Graphs are commonly used to encode relationships among entities, yet their abstractness makes them difficult to analyze. Node-link diagrams are popular for drawing graphs, and force-directed layouts provide a flexible method for node arrangements that ...
Hajij, Mustafa +4 more
core +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
The term layout problem was introduced in the context of Very Large-Scale Integration (VLSI) circuit design. Their main objective is to project an original graph onto a predefined host graph with a well-known topology, such as a path, cycle, or grid graph, among others.
Sergio Cavero +3 more
openaire +1 more source
Graph Exploration With Embedding-Guided Layouts
IEEE Transactions on Visualization and Computer GraphicsNode-link diagrams are widely used to visualize graphs. Most graph layout algorithms only use graph topology for aesthetic goals (e.g., minimize node occlusions and edge crossings) or use node attributes for exploration goals (e.g., preserve visible communities).
Leixian Shen +3 more
openaire +3 more sources
Graph Layout with Versatile Boundary Constraints
Journal of Graph Algorithms and Applications, 2016 Graph layouts are in general data dependent and help to reveal structural and attribute relationships in the data set. However, there are situations when one may wish to alter the layout e.g. to emphasize parts of the data set or for aesthetic reasons. This paper strives to meet that need for the case of force-directed graph layout algorithms.
Zhang, Yani, Pang, Alex
openaire +2 more sources
Improving Layered Graph Layouts with Edge Bundling [PDF]
, 2011 We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the layout produced by the Sugiyama scheme by bundling some of the edges together. The bundles are created by a new algorithm based on minimizing the total ink needed to draw the graph edges.
Pupyrev, S. +2 more
openaire +3 more sources
On graph-based design of floor layouts
Journal of Civil Engineering and Management, 2003 Knowledge-based tools assisting the designer in engineering represent further improvement of expert systems. The present paper shows how such software can be developed in the particular domain of floor layout design for buildings.
Adam Borkowski +2 more
doaj +1 more source
A bayesian paradigm for dynamic graph layout [PDF]
, 1997 Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map [ELMS91]. To retain this map at least partially, consecutive
Brandes, Ulrik, Wagner, Dorothea
openaire +3 more sources
A Review of Systematic Methodologies for Shipyard Facility Layout Design
KapalThe dynamic and complex nature of the shipbuilding industry necessitates efficient facility layout planning to optimize operational efficiency and minimize costs.
Ghulam Tulus Pambudi +3 more
doaj +1 more source
Journal of Integrative Bioinformatics, 2004 We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full ...
Brandes Ulrik, Dwyer Tim, Schreiber Falk
doaj +1 more source