Before revision:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for  map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact. These six desirable properties are formalized with the following guarantees: (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);
After revision:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for map-like visualization of large graphs . We propose seven desirable properties that such visualization should maintain and an algorithm that accomplishes them. (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);