Skip to main content

Clustering and Layout of Graphs with Attributed Nodes

  • Chapter
  • First Online:
Mathematical Insights into Advanced Computer Graphics Techniques (MEIS 2016, MEIS 2017)

Abstract

Many graphs used in real-world applications consist of nodes belonging to one or more categories, or associated with feature vectors (called “attributed node” in this paper). Graph clustering and layout are key techniques for effective visualization of such graphs. This paper briefly surveys these techniques and then introduces author’s own techniques on visualization of graphs with attributed nodes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Part of this article is reused from [6, 9]. Copyright 2009, 2015 IEEE, included here by permission.

  2. 2.

    http://nbaf.nerc.ac.uk/support/publications.

References

  1. Blythe J, McGrath C, Krackhardt D (1995) The effect of graph layout on inference from social network data. Graph Draw 40:51

    Google Scholar 

  2. Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E70:066111

    Google Scholar 

  3. Eades P (1984) A heuristics for graph drawing. Congr Numer 42:146–160

    MathSciNet  Google Scholar 

  4. Gansner ER, Hu Y, North S (2013) A maxent-stress model for graph layout. IEEE Trans Vis Comput Graph 19(6):927–940

    Article  Google Scholar 

  5. Gibson H, Faith J, Vickers P (2013) A survey of two-dimensional graph layout techniques for information visualization. Inf Vis 12(3–4):324–357

    Article  Google Scholar 

  6. Itoh T, Klein K (2015) Key-node-separated graph clustering and layout for human relationship graph visualization. IEEE Comput Graph Appl 35(6):30–40

    Article  Google Scholar 

  7. Itoh T, Yamaguchi Y, Ikehata Y, Kajinaga Y (2004) Hierarchical data visualization using a fast rectangle-packing algorithm. IEEE Trans Vis Comput Graph 10(3):302–313

    Article  Google Scholar 

  8. Itoh T, Takakura H, Sawada A, Koyamada K (2006) Hierarchical visualization of network intrusion detection data in the IP address space. IEEE Comput Graph Appl 26(2):40–47

    Article  Google Scholar 

  9. Itoh T, Muelder C, Ma K-L, Sese J (2009) A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs. In: IEEE pacific visualization symposium, pp 121–128

    Google Scholar 

  10. Muelder C, Ma K-L (2008) A treemap based method for rapid layout of large graphs. In: IEEE pacific visualization symposium, pp 231–238

    Google Scholar 

  11. Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1(1):27–64

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takayuki Itoh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Itoh, T. (2019). Clustering and Layout of Graphs with Attributed Nodes. In: Dobashi, Y., Kaji, S., Iwasaki, K. (eds) Mathematical Insights into Advanced Computer Graphics Techniques. MEIS MEIS 2016 2017. Mathematics for Industry, vol 32. Springer, Singapore. https://doi.org/10.1007/978-981-13-2850-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2850-3_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2849-7

  • Online ISBN: 978-981-13-2850-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics