Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
Michael Klugerman, Alexander Russell, Ravi Sundara...
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...