Date of Award

8-1-2022

Language

English

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

College/School/Department

Department of Computer Science

Content Description

1 online resource (x, 67 pages) : illustrations (some color)

Dissertation/Thesis Chair

Jeong-Hyon Hwang

Committee Members

Petko Bogdanov, Chelmis Charalampos, Paul W. Olsen

Keywords

approximation, graph theory, group closeness centrality, network, prioritization, pruning, Graph theory, Data structures (Computer science)

Subject Categories

Computer Sciences

Abstract

Given a graph and an integer k, the goal of group closeness maximization is to find, among all possible sets of k vertices (called seed sets), a set that has the highest group closeness centrality. Existing techniques for this NP-hard problem strive to quickly find a seed set with a high, but not necessarily the highest centrality.

Download

Share

COinS