A practical approach to static node positioning

  • Junhui Luo
  • Kanth Miriyala
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

Abstract

This paper discusses how we adapted an algorithm by Kernighan and Lin [4] and its refinement by Fiduccia and Mattheyses [1] for network partitioning to get an efficient heuristic for aesthetically and statically laying out undirected graphs.

References

  1. 1.
    Fiduccia, C.M. and Mattheyses, R.M., A Linear-Time Heuristic for Improving Network Partitions, Proceedings of the 19th Design Automation Conference, IEEE, 1982, pp.175–181.Google Scholar
  2. 2.
    Miriyala, K. Hornick, S.W., and Tamassia, R, An Incremental Approach to Aesthetic Graph Layout, Proc. of 6th Intl. Workshop on Computer-Aided Software Engineering, 1993, pp.297–308.Google Scholar
  3. 3.
    Naidu, B. and Miriyala, K., Space Creation and Compaction in Dynamic Diagramming, Andersen Consulting Internal Paper.Google Scholar
  4. 4.
    Kernighan, B.W. and Lin, S.: An Efficient Heuristic Procedure for Partitioning graphs, Bell System Technical Journal, Vol. 49, Feb. 1970, pp.291–307.Google Scholar
  5. 5.
    Eades, P.: A Heuristic for Graph Drawing, Congressus Numerantium, Vol. 42, pp. 149–160, 1984.Google Scholar
  6. 6.
    Di Battista, Eades, P., and Tamassia, R.: Algorithms for Drawing Graphs: an Annotated bibliography, unpublished paper, March, 1993.Google Scholar
  7. 7.
    Fruchterman, T.M.J. and Reingold, E.M.: Graph Drawing by Force-Directed Placement, Software Practice and Experience, Vol. 21, No. 11, pp. 1129–1164, 1991Google Scholar
  8. 8.
    Tamassia, R., Di Battista, G., and Batini, C.: Automatic Graph Drawing and Readability of Diagrams, IEEE Trans. on Systems, Man, and Cybernetics, Vol. 18, No. 1, pp. 61–79, 1988.Google Scholar
  9. 9.
    Kamada, T.: On Visualization of Abstract Objects and Relations, Ph.D. thesis, Department of Information Science, University of Tokyo, 1988.Google Scholar
  10. 10.
    Garey, M., and Johnson, D.: Computers and Intractability: a guide to the theory of NP-completeness, W. Freeman and Company, 1979.Google Scholar
  11. 11.
    Cai, J.,Han, X., and Tarjan, R.E.,: An O(m log n)-time Algorithm for the Maximal Subgraph Problem, SIAM J. on Computing, 1993.Google Scholar
  12. 12.
    Batini, C., Nardelli, E., Talamo, M., and Tamassia, R.: A Graphtheoretic Approach to Aesthetic Layout of Information Systems Diagrams, Proc. 10th Intl. Workshop on Graphtheoretic Concepts in Computer Science (Berlin, June 1984), pp.9–18, Trauner Verlag, 1984.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Junhui Luo
    • 1
  • Kanth Miriyala
    • 1
  1. 1.Andersen ConsultingCenter for Strategic Technology ResearchChicagoUSA

Personalised recommendations