The Parameterized Complexity of Centrality Improvement in Networks

DOI10.1007/978-3-319-73117-9_8zbMath1444.68080arXiv1710.01576OpenAlexW2763281487MaRDI QIDQ5127175

Hendrik Molter, Clemens Hoffmann, Manuel Sorge

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.01576

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic

This page was built for publication: The Parameterized Complexity of Centrality Improvement in Networks