Related Experiment Video
Updated: Oct 7, 2025

Application of Granger Causality Analysis of the Directed Functional Connection in Alzheimer's Disease and Mild Cognitive Impairment
Published on: August 7, 2017
The Connected P-Median Problem on Cactus Graphs
Chunsong Bai1, Jianjie Zhou2, Zuosong Liang3
1School of Finance and Mathematics, Huainan Normal University, Huainan 232038, China.
Abstract:
This study deals with the facility location problem of locating a set V of p facilities on a graph such that the subgraph induced by V is connected. We consider the connected p-median problem on a cactus graph G whose vertices and edges have nonnegative weights. The aim of a connected p-median problem is to minimize the sum of weighted distances from every vertex of a graph to the nearest vertex in V . We provide an O(n 2 p 2) time algorithm for the connected p-median problem, where n is the number of vertices.
Related Concept Videos
Median
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Theorems of Pappus and Guldinus: Problem Solving
Mesh Analysis with Current Sources
Current Source in One Mesh: The analysis process is straightforward when a current source is found in only one mesh within the circuit. Mesh currents are assigned as usual, with the mesh containing the current source excluded from the analysis. Kirchhoff's voltage law...
Measures of Central Tendency

