Sciweavers

469 search results - page 15 / 94
» Directed Graphs of Entanglement Two
Sort
View
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 8 months ago
Graph Database Indexing Using Structured Graph Decomposition
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...
David W. Williams, Jun Huan, Wei Wang 0010
WWW
2007
ACM
14 years 8 months ago
Anchor-based proximity measures
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...
IMCSIT
2010
13 years 5 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
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...
Michal Klisowski, Vasyl Ustimenko
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 7 months ago
A measure of similarity between graph vertices
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
Vincent D. Blondel, Anahí Gajardo, Maureen ...
TIT
2008
140views more  TIT 2008»
13 years 7 months ago
A Resource Framework for Quantum Shannon Theory
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...