We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew To...
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...