Results 81 to 90 of about 260,743 (188)

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

Towards Scalable Visual Exploration of Very Large RDF Graphs

, 2015
In this paper, we outline our work on developing a disk-based infrastructure for efficient visualization and graph exploration operations over very large graphs.
A Dadzie, C Tominski, D Archambault, D Auber, J Abello, M Alonen, M Dudáš, M Zinsmaier, N Bikakis, P Heim, S Mazumdar, S Mazumdar   +11 more
core   +1 more source

Graph Layout Problems

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, Eduardo G. Pardo, Abraham Duarte, Rafael Martí   +3 more
openaire   +1 more source

Graph Exploration With Embedding-Guided Layouts

IEEE Transactions on Visualization and Computer Graphics
Node-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, Zhiwei Tai, Enya Shen, Jianmin Wang   +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., Nachmanson, L., Kaufmann, M.   +2 more
openaire   +3 more sources

A parent-centered radial layout algorithm for interactive graph visualization and animation [PDF]

, 2006
We have developed (1) a graph visualization system that allows users to explore graphs by viewing them as a succession of spanning trees selected interactively, (2) a radial graph layout algorithm, and (3) an animation algorithm that generates meaningful
Homan, Christopher, Pavlo, Andrew, Schull, Jonathan   +2 more
core   +2 more sources

A Distributed Multilevel Force-directed Algorithm

, 2016
The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS
A Arleo, A Ching, A Godiyal, C Walshaw, D Harel, G Bartel, LG Valiant, M Chimani, M Zinsmaier, P Gajer, P Sharma, R Hadany, RA Rossi, S Hachul, S Hachul, S Ingram, SG Kobourov, TMJ Fruchterman, W Didimo, Y Hu   +19 more
core   +1 more source

Graph layout for applications in compiler construction [PDF]

, 1996
We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs.
Sander, Georg
core   +1 more source

A Review of Systematic Methodologies for Shipyard Facility Layout Design

Kapal
The dynamic and complex nature of the shipbuilding industry necessitates efficient facility layout planning to optimize operational efficiency and minimize costs.
Ghulam Tulus Pambudi, Gunawan Gunawan, Dimas Angga Fakhri Muzhoffar, Wanda Rulita Sari   +3 more
doaj   +1 more source