Algorithmic and structural aspects of the P 3 -Radon number

Mitre Dourado (), Dieter Rautenbach (), Vinícius Santos (), Philipp Schäfer (), Jayme Szwarcfiter () and Alexandre Toman ()

Annals of Operations Research, 2013, vol. 206, issue 1, 75-91

Abstract: The generalization of classical results about convex sets in ℝ 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’s classical convexity result. We establish hardness results and describe efficient algorithms for trees. Copyright Springer Science+Business Media New York 2013

Keywords: Graph convexity; Radon partition; Radon number (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-013-1320-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:206:y:2013:i:1:p:75-91:10.1007/s10479-013-1320-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-013-1320-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().