Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations...
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...