Higres — Visualization System for Clustered Graphs and Graph Algorithms

  • Ivan A. Lisitsyn
  • Victor N. Kasyanov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


We present the Higres system - a visualization tool, an editor for clustered graphs and a platform for execution and animation of graph algorithms. Higres can handle any attributed graphs and perform animated semantic processing of them. The semantics of a graph can be defined by the user in the graph editor. The user can also create new external modules to process graphs with defined semantics. In addition we provide a possibility to extend system with new graph drawing algorithms by using special type of external modules for this purpose. We provide an easy to use C++ library for implementation of both types of extensions.


Object Type Visualization System Graph Algorithm Classical Graph Cluster Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    G. Sander. Graph layout through the VCG tool. Proc. of Graph Drawing’ 94, volume 894 of LNCS, pages 194–205, 1995.Google Scholar
  2. 2.
    M. Fröhlich and M. Werner. Demonstration of the interactive graph visualization system daVinci. Proc. of Graph Drawing’ 94, volume 894 of LNCS, pages 266–269, 1995.Google Scholar
  3. 3.
    M. Himsolt. The Graphlet System (system demonstration). Proc. of Graph Drawing’ 96, volume 1190 of LNCS, pages 233–240, 1997.Google Scholar
  4. 4.
    H. Lauer, M. Ettrich and K. Soukup. GraVis-System Demonstration. Proc. of Graph Drawing’ 97, volume 1353 of LNCS, pages 344–349, 1997.CrossRefGoogle Scholar
  5. 5.
    B. Madden, P. Madden, S. Powers and M. Himsolt. Portable Graph Layout and Editing. Proc. of Graph Drawing’ 95, volume 1027 of LNCS, pages 385–395, 1996.CrossRefGoogle Scholar
  6. 6.
    K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96–102, 1995.CrossRefGoogle Scholar
  7. 7.
    K. Siguyama and K. Misue. A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR. Proc. of Graph Drawing 95, volume 1027 of LNCS, pages 500–503, 1996.CrossRefGoogle Scholar
  8. 8.
    P. Eades, Q.W. Feng. Drawing Clustered Graphs on an Orthogonal Grid. Proc. of Graph Drawing 97, volume 1353 of LNCS, pages 182–193, 1997.Google Scholar
  9. 9.
    P. Eades, Q.W. Feng. Multilevel visualization of Clustered Graphs. Proc. of Graph Drawing 96, volume 1190 of LNCS, pages 101–112, 1997.Google Scholar
  10. 10.
    P. Eades, Q.W. Feng and X. Lin. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Proc. of Graph Drawing 96, volume 1190 of LNCS, pages 113–128, 1997.Google Scholar
  11. 11.
    Q. W. Feng, R. Cohen and P. Eades. How to draw a planar clustered graph. In COCOON’95, volume 959 of LNCS, pages 21–31, 1995.Google Scholar
  12. 12.
    P. Eades. A Heuristic For Graph Drawing. Congressus Numerantium, 42, pages 149–160, 1984.MathSciNetGoogle Scholar
  13. 13.
    M. L. Huang, P. Eades. A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. Proc. of Graph Drawing 98, volume 1547 of LNCS, pages 374–383, 1998.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ivan A. Lisitsyn
    • 1
  • Victor N. Kasyanov
    • 1
  1. 1.A. P. Ershov’s Institute of Informatics SystemsNovosibirskRussia

Personalised recommendations