Measuring node centrality is a critical common denominator behind many important graph mining tasks. While the existing literature offers a wealth of different node centrality measures, it remains a daunting task on how to intervene the node centrality in a desired way. In this thesis, we study the problem of minimizing the centrality of one or more target nodes by edge operation.
Download count: 0
- Partial requirement for: M.S., Arizona State University, 2016Note typethesis
- Includes bibliographical references (pages 38-41)Note typebibliography
- Field of study: Computer science