The parameterized complexity of maximum betweenness centrality
From MaRDI portal
Publication:6636087
Cites work
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- Finding groups with maximum betweenness centrality via integer programming with random path sampling
- Fixed-parameter tractable algorithms for tracking shortest paths
- Graph theory
- Group Centrality Maximization for Large-scale Graphs
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Imbalance parameterized by twin cover revisited
- Improved upper bounds for vertex cover
- Integer Programming with a Fixed Number of Variables
- Local linear set on graphs with bounded twin cover number
- Maximizing Social Welfare in Score-Based Social Distance Games
- Maximum betweenness centrality: approximability and tractable cases
- On the complexity of \(k\)-SAT
- Parameterized algorithms
- Parameterized complexity of Vertex Cover variants
- Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Polynomial kernels for tracking shortest paths
- Structural parameterizations of Tracking Paths problem
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The centrality of groups and classes
- Tracking paths
- Treewidth and pathwidth parameterized by the vertex cover number
- Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar
This page was built for publication: The parameterized complexity of maximum betweenness centrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636087)
