Results 31 to 40 of about 29,184 (301)
IEEE Access, 2019 Visualization of the small world network is an excellent challenge for classic layout algorithm, which is highly connected, resulting in the shape of the hairball.
Cheng Zhan +4 more
doaj +1 more source
Improving Search-Based Schematic Layout by Parameter Manipulation [PDF]
, 2015 This paper reports on a method to improve the automated layout of schematic diagrams by widening the search space examined by the system. In search-based layout methods there are typically a number of parameters that control the search algorithm which ...
Rodgers, Peter, Chivers, Daniel
core +1 more source
Demonstration of a Preprocessor for the Spring Embedder [PDF]
, 2002 Spring embedding is a widely used method for producing automated layouts of graphs. We present a preprocessor that improves the performance of the classical spring embedder which can be used in conjunction with other optimization and approximation ...
Rodgers, Peter +3 more
core +1 more source
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
Metro Map Layout Using Multicriteria Optimization [PDF]
, 2004 We describe a system to automatically generate metro maps using a multicriteria approach. We have implemented a hill climbing optimizer which uses a fitness score generated from a sum of several aesthetic metrics.
Rodgers, Peter, Stott, Jonathan
core +1 more source
On a class of metrics related to graph layout problems [PDF]
, 2010 We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O +13 more
core +1 more source
Node-attribute graph layout for small-world networks [PDF]
, 2011 Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs,
Joe Faith +3 more
core +1 more source
Octilinear Force-Directed Layout with Mental Map Preservation for Schematic Diagrams [PDF]
, 2014 We present an algorithm for automatically laying out metro map style schematics using a force-directed approach, where we use a localized version of the standard spring embedder forces combined with an octilinear magnetic force.
Rodgers, Peter +3 more
core +1 more source
Feasible Sanitary Sewer Network Generation Using Graph Theory
Advances in Civil Engineering, 2019 A graph theory-based methodology is proposed for the sewer system optimization problem in this study. Sewer system optimization includes two subproblems: layout optimization and hydraulic design optimization, which can be solved independently or solved ...
Mustafa Erkan Turan +3 more
doaj +1 more source
Queue Layouts of Graph Products and Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ .
David R. Wood
doaj +3 more sources