Free Access
| Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|
|
|---|---|---|
| Page(s) | S2403 - S2415 | |
| DOI | https://doi.org/10.1051/ro/2020089 | |
| Published online | 02 March 2021 | |
- M. Albenque and K. Knauer, Convexity in partial cubes: the hull number. In: LATIN 2014: Theoretical Informatics. Springer, New York, NY (2014) 421–432. [Google Scholar]
- B.S. Anand, M. Changat, S. Klavžar and I. Peterin, Convex sets in lexicographic products of graphs. Graphs Comb. 28 (2012) 77–84. [Google Scholar]
- J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio and R. Soares, On the hull number of some graph classes. Theor. Comput. Sci. 475 (2013) 1–12. [Google Scholar]
- S.R. Canoy, Jr. and I. Garces, Convex sets under some graph operations. Graphs Comb. 18 (2002) 787–793. [Google Scholar]
- C.C. Centeno, M.C. Dourado, L.D. Penso, D. Rautenbach and J.L. Szwarcfiter, Irreversible conversion of graphs. Theor. Comput. Sci. 412 (2011) 3693–3700. [Google Scholar]
- E.M.M. Coelho, H. Coelho, J.R. Nascimento and J.L. Szwarcfiter, On the geodetic hull number of complementary prisms. Preprint: arXiv:1807.08295 (2018). [Google Scholar]
- P. Domingos and M. Richardson, Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD ’01. ACM. New York, NY, (2001) 57–66. [Google Scholar]
- M.C. Dourado and R.M. Sampaio, Complexity aspects of the triangle path convexity. Discrete Appl. Math. 206 (2016) 39–47. [Google Scholar]
- M.C. Dourado, J.G. Gimbel, J. Kratochvíl, F. Protti and J.L. Szwarcfiter, On the computation of the hull number of a graph. Discrete Math. 309 (2009) 5668–5674. [Google Scholar]
- M.C. Dourado, F. Protti, D. Rautenbach and J.L. Szwarcfiter, On the hull number of triangle-free graphs. SIAM J. Discrete Math. 23 (2010) 2163–2172. [Google Scholar]
- M.C. Dourado, F. Protti and J.L. Szwarcfiter, Complexity results related to monophonic convexity. Discrete Appl. Math. 158 (2010) 1268–1274. [Google Scholar]
- M.C. Dourado, L.D. Penso and D. Rautenbach, On the geodetic hull number of Pk-free graphs. Theor. Comput. Sci. 640 (2016) 52–60. [Google Scholar]
- P.A. Dreyer and F.S. Roberts, Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete App. Math. 157 (2009) 1615–1627. [Google Scholar]
- M.A. Duarte, L. Penso, D. Rautenbach and U. dos Santos Souza, Complexity properties of complementary prisms. J. Comb. Optim. 33 (2017) 365–372. [Google Scholar]
- M.G. Everett and S.B. Seidman, The hull number of a graph. Discrete Math. 57 (1985) 217–223. [Google Scholar]
- S. Foldes and P.L. Hammer, Split graphs. In: Proceedings 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, LA (1977) 311–315. [Google Scholar]
- T.W. Haynes, M.A. Henning, P.J. Slater and L.C. van der Merwe, The complementary product of two graphs. Bull. Inst. Comb. App. 51 (2007) 21–30. [Google Scholar]
- C. Hernando, T. Jiang, M. Mora, I.M. Pelayo and C. Seara, On the Steiner, geodetic and hull numbers of graphs. Discrete Math. 293 (2005) 139–154. [Google Scholar]
- M.M. Kanté and L. Nourine, Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. SIAM J. Discrete Math. 30 (2016) 311–326. [Google Scholar]
- D. Peleg, Local majorities, coalitions and monopolies in graphs: a review. Theor. Comput. Sci. 282 (2002) 231–257. [Google Scholar]
- I. Peterin, Intervals and convex sets in strong product of graphs. Graphs Comb. 29 (2013) 705–714. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.