Contact Prediction, Routing and Fast Information Spreading in Social Networks by Kazem Jahanbakhsh B.Sc., Sharif University of Technology, 2001 M.Sc., Sharif University of Technology, 2005 A Dissertation Submitted in Par

First Page		Document Content
Date: 2013-03-29 00:49:15 Network theory Networks Clique Centrality Routing Algorithm Graph Shortest path problem Greedy algorithm Mathematics Graph theory Combinatorics		Contact Prediction, Routing and Fast Information Spreading in Social Networks by Kazem Jahanbakhsh B.Sc., Sharif University of Technology, 2001 M.Sc., Sharif University of Technology, 2005 A Dissertation Submitted in Par Add to Reading List Source URL: www.kazemjahanbakhsh.com Download Document from Source Website File Size: 899,92 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