• OGDF

  • Referenced in 33 articles [sw04102]
  • practice, and practical evaluation of graph drawing algorithms is essential. However, graph drawing ... huge amount of algorithms for various drawing styles and applications has been proposed. Many sophisticated ... covers a wide range of graph drawing algorithms. However, the lack of publicly available source ... provides: A wide range of graph drawing algorithms that allow to reuse and replace particular...
  • InterViewer

  • Referenced in 29 articles [sw00443]
  • faster than other recent implementations of drawing algorithms; (2) it can be used not only...
  • AGD

  • Referenced in 12 articles [sw00022]
  • Algorithms for Graph Drawing. A graph drawing algorithm produces a layout of a graph ... unlikely that a definition of the “optimal drawing” of a graph in a strict mathematical ... sense exists. A large number of graph drawing algorithmstaking different aesthetic criteria into account have ... broad range of existing algorithms for two-dimensional graph drawing and tools for implementing...
  • BoomerAMG

  • Referenced in 195 articles [sw00086]
  • parallel AMG code, using the algorithm of A. J. Cleary, R. D. Falgout ... range of problem sizes and descriptions, and draw conclusion regarding the efficacy of the method...
  • VARNA

  • Referenced in 5 articles [sw16406]
  • databases. FEATURES: VARNA implements four drawing algorithms, supports input/output using the classic formats ... bpseq and RNAML and exports the drawing as five picture formats, either pixel-based (JPEG...
  • TopoLayout

  • Referenced in 8 articles [sw11876]
  • describe TopoLayout, a feature-based, multilevel algorithm that draws undirected graphs based on the topological ... hierarchy. Each feature is drawn with an algorithm tuned for its topology. As would...
  • MultiPlane

  • Referenced in 4 articles [sw01966]
  • plane using well-known 2D drawing algorithms. Finally, a 3D drawing of the whole graph...
  • SIMEM3 Renault

  • Referenced in 40 articles [sw04243]
  • Gauss-Seidel like algorithm to solve frictional contact problems We present mathematical and numerical results ... been implemented in a dynamical deep drawing simulation software (SIMEM3 Renault) where unilateral contact ... viewed as a nonlinear block Gauss-Seidel algorithm. A convergence theorem is proved using nonsmooth...
  • TimGA

  • Referenced in 2 articles [sw01622]
  • TimGA: A genetic algorithm for drawing undirected graphs The problem of drawing graphs nicely contains ... natural to apply genetic algorithms to graph drawing. This paper introduces a Genetic Algorithm (TimGA...
  • recmap

  • Referenced in 2 articles [sw15698]
  • citation(”recmap”)’ for details). This algorithm draws maps according to a given statistical value ... data). The basic idea of the RecMap algorithm is that each map region...
  • GRIP

  • Referenced in 10 articles [sw12696]
  • Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi ... together with fast energy function minimization. The algorithm underlying the system employs a simple recursive ... viewing. The GRIP system allows for drawing graphs with tens of thousands of vertices ... algorithms. However, speed is not achieved at the expense of quality as the resulting drawings...
  • GDS

  • Referenced in 1 article [sw13546]
  • many different fields, new graph drawing algorithms are continually being developed and implemented. However, there ... terminology and literature of the graph drawing community. Then she must locate and install...
  • Anagopos

  • Referenced in 1 article [sw17745]
  • reduction graphs under six different graph drawing algorithms. We provide ample examples of graphs drawn...
  • PseudoViewer3

  • Referenced in 6 articles [sw17134]
  • previous algorithm, and produces a more compact and aesthetic structure drawing. PseudoViewer3 supports both...
  • Jsnetworkx

  • Referenced in 1 article [sw20730]
  • build network models, design new network algorithms, draw networks, and much more. JSNetworkX aims...
  • Decon2LS

  • Referenced in 3 articles [sw16610]
  • high-resolution MS data. Drawing extensively on algorithms developed over the last ten years...
  • SpringVisCom

  • Referenced in 1 article [sw34807]
  • Tomihisa Kamada and Satoru Kawai: ”An Algorithm For Drawing General Undirected Graphs”), where nodes...
  • GrASP

  • Referenced in 1 article [sw38091]
  • Python library for GrASP, an existing algorithm for drawing patterns from textual data. The library...
  • AdMit

  • Referenced in 8 articles [sw09498]
  • draws from it, given only a kernel of the target density function. The core algorithm...
  • glmtree

  • Referenced in 2 articles [sw33576]
  • particular stochastic expectation maximization algorithm is used to draw a few good trees, that...