The parameterized complexity of centrality improvement in networks

Clemens Hoffmann, Hendrik Molter, Manuel Sorge

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applications, as a higher centrality often implies a larger impact on the network or less transportation or administration cost. In this work we study the parameterized complexity of the NP-complete problems Closeness Improvement and Betweenness Improvement in which we ask to improve a given vertex’ closeness or betweenness centrality by a given amount through adding a given number of edges to the network. Herein, the closeness of a vertex v sums the multiplicative inverses of distances of other vertices to v and the betweenness sums for each pair of vertices the fraction of shortest paths going through v. Unfortunately, for the natural parameter “number of edges to add” we obtain hardness results, even in rather restricted cases. On the positive side, we also give an island of tractability for the parameter measuring the vertex deletion distance to cluster graphs.

Original languageEnglish
Title of host publicationSOFSEM 2018
Subtitle of host publicationTheory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings
EditorsJirí Wiedermann, A Min Tjoa, Stefan Biffl, Ladjel Bellatreche, Jan van Leeuwen
PublisherSpringer Verlag
Pages111-124
Number of pages14
ISBN (Print)9783319731162
DOIs
StatePublished - 1 Jan 2018
Event44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018 - Krems, Austria
Duration: 29 Jan 20182 Feb 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10706 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018
Country/TerritoryAustria
CityKrems,
Period29/01/182/02/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'The parameterized complexity of centrality improvement in networks'. Together they form a unique fingerprint.

Cite this