搜索结果: 1-3 共查到“应用数学 connectivity”相关记录3条 . 查询时间(0.016 秒)
Connectivity in Sub-Poisson Networks
Connectivity in Sub-Poisson Networks
font style='font-size:12px;'>
2010/12/14
We consider a class of point processes (pp), which we call sub-Poisson; these are pp that can be directionally-convexly (dcx) dominated by some Poisson pp.
The p-center problem with connectivity constraint
connected p-center induced subgraph NP-Hard bipartite graph
font style='font-size:12px;'>
2010/9/15
Let G(V, E, W) be a graph with n-vertex-set V and m-edge-set E in which each
edge e is associated with a positive distance W(e). The p-Center problem is to locate
some kind of facilities at p vertic...
Bound on m-restricted Edge Connectivity
regular graph bound restricted edge connectivity
font style='font-size:12px;'>
2007/12/10
An m-restricted edge cut is an edge cut that separates a connected graph into a disconnected one with no components having order less than m. m-restricted edge connectivity λ_m is the cardinality of a...