Vertex-neighboring multilevel force-directed graph drawing

We introduce a new force-directed graph drawing algorithm for large undirected graphs with at least a few hundreds of vertices. Our algorithm falls into the class of multilevel force-directed graph drawing algorithms. Unlike other multilevel algorithms it has no pre-processing step and it also ignores repulsion forces between pairs of non-adjacent vertices. As a result, our algorithm demonstrably outperforms known multilevel algorithms in terms of running time while keeping the quality of the layout sufficiently good.