Force-directed graph drawing

Known as: Force-directed layout, Spring-based algorithm, Force directed graph drawing 
Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We introduce a new force-directed graph drawing algorithm for large undirected graphs with at least a few hundreds of vertices… (More)
  • figure 1
  • figure 4
  • figure 8
  • figure 10
Is this relevant?
2015
2015
We propose a genetic algorithm (GA) for solving the maximization version of the Optimal Linear Arrangement problem and we also… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2012
2012
Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2012
Review
2012
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
A Lombardi drawing of a graph is defined as one in which vertices are represented as points, edges are represented as circular… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Macro cells are used more and more in current designs as they provide the benefit of reusability directly resulting in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2007
2007
In this paper, we propose a fast and efficient method for drawing very large-scale graph data. The conventional force-directed… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 5
Is this relevant?
2005
2005
We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?