GRECS: Graph Encryption for Approximate Shortest Distance Queries Xianrui Meng∗1 , Seny Kamara†2 , Kobbi Nissim‡3 , and George Kollios§1 1 Department of Computer Science, Boston University

First Page		Document Content
Date: 2015-03-22 08:44:39 Search algorithms Network theory Shortest path problem Breadth-first search Graph Homomorphic encryption Graph connectivity Graph theory Mathematics Theoretical computer science		GRECS: Graph Encryption for Approximate Shortest Distance Queries Xianrui Meng∗1 , Seny Kamara†2 , Kobbi Nissim‡3 , and George Kollios§1 1 Department of Computer Science, Boston University Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 857,93 KB Share Document on Facebook

	EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples DocID: 1vg0M - View Document
	We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or DocID: 1sauD - View Document
	We approach the problem of computing geometric centralities, such as closeness and harmonic centrality, on very large graphs; traditionally this task requires an all-pairs shortest-path computation in the exact case, or DocID: 1rNo2 - View Document
	Improving Restoration Success in Mesh Optical Networks Fang Yu 1, Rakesh Sinha2, Dongmei Wang3, Guangzhi Li3, John Strand2, Robert Doverspike2, Charles Kalmanek 3, and Bruce Cortez 2 1 EECS Department, UC Berkeley, Berke DocID: 1rrH0 - View Document
	CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016 DocID: 1rn0k - View Document