Evaluating Centrality Metrics in Real-World Networks on GPU Anuroop Sriram Kollu Gautham Kishore Kothapalli P. J. Narayan R Govindarajulu International Institute of Information Technology, Hyderabad Gachibowli, Hyderabad

First Page		Document Content
Date: 2009-11-13 17:38:52 Theoretical computer science Networks Network analysis Search algorithms Centrality Betweenness centrality Shortest path problem Breadth-first search Parallel computing Mathematics Graph theory Network theory		Evaluating Centrality Metrics in Real-World Networks on GPU Anuroop Sriram Kollu Gautham Kishore Kothapalli P. J. Narayan R Govindarajulu International Institute of Information Technology, Hyderabad Gachibowli, Hyderabad Add to Reading List Source URL: www.hipc.org Download Document from Source Website File Size: 175,20 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