The following pages link to Fang Tian (Q413282):
Displaying 6 items.
- Probabilistic single obnoxious facility location with fixed budget (Q413284) (← links)
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning (Q714518) (← links)
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
- Distance irredundance and connected domination numbers of a graph (Q860459) (← links)
- Average distances and distance domination numbers (Q1028442) (← links)
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
