Conference Proceedings

A practical approach to static node positioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 894 436-443
DOI: 10.1007/3-540-58950-3_397
0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Luo, J., & Miriyala, K. (1995). A practical approach to static node positioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 436–443). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_397

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free