Skip to main content
SpringerLink
Log in

Fruchterman/Reingold (1991): Graph Drawing by Force-Directed Placement

  • Chapter
  • First Online:
Schlüsselwerke der Netzwerkforschung

Part of the book series: Netzwerkforschung ((NETZFO))

Zusammenfassung

Mit dem Artikel stellen die Autoren einen Algorithmus vor, der » ästhetisch ansprechende « (p. 1129) Visualisierungen von Graphen erzeugen kann, vergleichsweise schnell arbeitet und simpel zu implementieren ist. Der Algorithmus ist für ungerichtete und damit für die allgemeinste Klasse von Graphen entworfen worden.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  • Brandes, U. & Pich, C. (2009). An Experimental Study on Distance-Based Graph Drawing. In I. G. Tollis & M. Patrignani (Hrsg.), Graph Drawing (S. 218 – 229). Berlin/Heidelberg: Springer.

    Chapter  Google Scholar 

  • Eades, P. (1984). A Heuristic for Graph Drawing. Congressus Numerantium 42(11), 149 – 160.

    Google Scholar 

  • Fruchterman, T. M. J. & Reingold, E. M. (1991). Graph drawing by force-directed placement. Software: Practice and Experience 21 (11), 1129 – 1164.

    Google Scholar 

  • Kamada, T. & Kawai, S. (1989). An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7 – 15.

    Article  Google Scholar 

  • Torgerson, W. S. (1952). Multidimensional Scaling. Theory and Method 17, 401 – 419.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. München, Deutschland

    Mirco Schönfeld & Jürgen Pfeffer

Authors
  1. Mirco Schönfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Pfeffer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mirco Schönfeld .

Editor information

Editors and Affiliations

  1. FB Geschichte und Soziologie, Universität Konstanz, Konstanz, Baden-Württemberg, Germany

    Boris Holzer

  2. Institut für Soziologie, Goethe-Universität Frankfurt am Main , Frankfurt a.M., Germany

    Christian Stegbauer

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Schönfeld, M., Pfeffer, J. (2019). Fruchterman/Reingold (1991): Graph Drawing by Force-Directed Placement. In: Holzer, B., Stegbauer, C. (eds) Schlüsselwerke der Netzwerkforschung. Netzwerkforschung. Springer VS, Wiesbaden. https://doi.org/10.1007/978-3-658-21742-6_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-658-21742-6_49

  • Published:

  • Publisher Name: Springer VS, Wiesbaden

  • Print ISBN: 978-3-658-21741-9

  • Online ISBN: 978-3-658-21742-6

  • eBook Packages: Social Science and Law (German Language)

Publish with us

Policies and ethics

Search

Navigation