The parameterized complexity of maximum betweenness centrality
type: Item
instance of: scholarly article
title: The parameterized complexity of maximum betweenness centrality
DOI: 10.1007/978-981-97-2340-9_19
author: Šimon Schierreich
author: José Gaspar Smutný
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7941775
zbMATH Keywords: maximum betweenness centrality
zbMATH Keywords: centrality measures
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: structural restrictions
zbMATH Keywords: social network analysis
zbMATH Keywords: vertex cover
zbMATH Keywords: distance to clique
zbMATH Keywords: twin-cover
MaRDI profile type: Publication
cites work: Group Centrality Maximization for Large-scale Graphs
cites work: Fixed-parameter tractable algorithms for tracking shortest paths
cites work: Tracking paths
cites work: Constant factor approximation for tracking paths and fault tolerant feedback vertex set
cites work: Polynomial kernels for tracking shortest paths
cites work: Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters
cites work: Treewidth and pathwidth parameterized by the vertex cover number
cites work: Improved upper bounds for vertex cover
cites work: Structural parameterizations of Tracking Paths problem
cites work: Parameterized Algorithms
cites work: Graph Theory
cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
cites work: The centrality of groups and classes
cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover
cites work: Maximum Betweenness Centrality: Approximability and Tractable Cases
cites work: Q3455032
cites work: Maximizing Social Welfare in Score-Based Social Distance Games
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Parameterized complexity of Vertex Cover variants
cites work: Grouped domination parameterized by vertex cover, twin cover, and beyond
cites work: Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar
cites work: On the complexity of \(k\)-SAT
cites work: Local linear set on graphs with bounded twin cover number
cites work: Finding groups with maximum betweenness centrality via integer programming with random path sampling
cites work: Integer Programming with a Fixed Number of Variables
cites work: Imbalance parameterized by twin cover revisited
description: scientific article; zbMATH DE number 7941775