科研之友
微信
新浪微博
Facebook
分享链接
摘要
The generalization of classical results about convex sets in a%26quot;e (n) to abstract convexity spaces, defined by sets of paths in graphs, leads to many challenging structural and algorithmic problems. Here we study the Radon number for the P (3)-convexity on graphs. P (3)-convexity has been proposed in connection with rumour and disease spreading processes in networks and the Radon number allows generalizations of Radon%26apos;s classical convexity result. We establish hardness results and describe efficient algorithms for trees.
- 出版日期2013-7
