We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...