Open Access
Issue |
RAIRO-Oper. Res.
Volume 57, Number 5, September-October 2023
|
|
---|---|---|
Page(s) | 2799 - 2818 | |
DOI | https://doi.org/10.1051/ro/2023145 | |
Published online | 31 October 2023 |
- B. Balasundaram, S.S. Chandramouli and S. Trukhanov, Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optim. Lett. 4 (2010) 311–320. [CrossRef] [MathSciNet] [Google Scholar]
- B. Balasundaram, S. Butenko and I.V. Hicks, Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59 (2011) 133–142. [CrossRef] [MathSciNet] [Google Scholar]
- S. Bandyapadhyay, A variant of the maximum weight independent set problem. Preprint arXiv:1409.0173 (2014). [Google Scholar]
- N. Betzler, R. Bredereck, R. Niedermeier and J. Uhlmann, On bounded-degree vertex deletion parameterized by treewidth. Discrete Appl. Math. 160 (2012) 53–60. [CrossRef] [MathSciNet] [Google Scholar]
- A.A. Bhave, Greedy randomized adaptive search procedure for the maximum co-k-plex problem. Ph.D. Thesis Oklahoma State University (2010). [Google Scholar]
- A. Brandstädt, V.V. Lozin and R. Mosca, Independent sets of maximum weight in apple-free graphs. SIAM J. Discrete Math. 24 (2010) 239–254. [CrossRef] [MathSciNet] [Google Scholar]
- S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura and O. Petersson, Information disseminating schemes for fault tolerance in hypercubes. IEICE Trans. Fundam. 75 (1992) 255–260. [Google Scholar]
- G.H. Chen, M.T. Kuo and J.P. Sheu, An optimal time algorithm for finding a maximum weight independent set in a tree. BIT 28 (1988) 353–356. [CrossRef] [MathSciNet] [Google Scholar]
- M. Cygan, F.V. Fomin, Ł. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk and S. Saurabh, Parameterized Algorithms.Springer (2015) 162–167. [Google Scholar]
- A. Dessmark, K. Jansen and A. Lingas, The maximum k-dependent and f-dependent set problem, in International Symposium on Algorithms and Computation. Springer (1993) 88–97. [CrossRef] [Google Scholar]
- H. Djidjev, O. Garrido, C. Levcopoulos and A. Lingas, On the maximum k-dependent set problem. Technical Report LU-CS-TR:92–91 Department of Computer Science, Lund University, Sweden (1992). [Google Scholar]
- T. Ekim and J. Gimbel, Some defective parameters in graphs. Graphs Comb. 29 (2013) 213–224. [CrossRef] [Google Scholar]
- M.R. Fellows, J. Guo, H. Moser and R. Niedermeier, A generalization of Nemhauser and Trotter’s local optimization theorem. J. Comput. Syst. 77 (2011) 1141–1158. [CrossRef] [Google Scholar]
- H. Fichtenberger, P. Peng and C. Sohler, Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty, in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM (2019) 714–726. [CrossRef] [Google Scholar]
- N. Fountoulakis, R.J. Kang and C. McDiarmid, The k-stability number of a random graph. Electron. J. Comb. 17 (2010) R59. [CrossRef] [Google Scholar]
- S. Hosseinian and S. Butenko, An improved approximation for maximum k-dependent set on bipartite graphs. Discrete Appl. Math. 307 (2022) 95–101. [CrossRef] [MathSciNet] [Google Scholar]
- F. Havet, R.J. Kang and J. Sereni, Improper coloring of unit disk graphs. Networks 54 (2009) 150–164. [CrossRef] [MathSciNet] [Google Scholar]
- M. Kumar, S. Mishra, N.S. Devi and S. Saurabh, Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theor. Comput. Sci. 526 (2014) 90–96. [CrossRef] [Google Scholar]
- V.V. Lozin and M. Milanič, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6 (2008) 595–604. [CrossRef] [MathSciNet] [Google Scholar]
- G.J. Minty, On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28 (3) (1980) 284–304. [CrossRef] [Google Scholar]
- B. McClosky, J.D. Arellano and I.V. Hicks, Co-2-plex vertex partitions. J. Comb. Optim. 30 (2015) 729–746. [CrossRef] [MathSciNet] [Google Scholar]
- I. Newman and C. Sohler, Every property of hyperfinite graphs is testable. SIAM J. Comput. 42 (2013) 1095–1112. [CrossRef] [MathSciNet] [Google Scholar]
- R. Niedermeier, Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006) 88–89. [CrossRef] [Google Scholar]
- S.B. Seidman and B.L. Foster, A graph-theoretic generalization of the clique concept. J. Math. Soc. 6 (1978) 139–154. [CrossRef] [Google Scholar]
- J. Tu, Y. Li and J. Du, Maximal and maximum dissociation sets in general and triangle-free graphs, Appl. Math. Comput. 426 (2022) 127107. [CrossRef] [Google Scholar]
- J. Tu, Z. Zhang and Y. Shi, The maximum number of maximum dissociation sets in trees. J. Graph Theory 96 (2020) 472–489. [Google Scholar]
- M. Xiao and S. Kou, Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theor. Comput. Sci. 657 (2017) 86–97. [CrossRef] [Google Scholar]
- M. Yannakakis, Node-deletion problems on bipartite graphs. SIAM J. Comput. 10 (1981) 310–327. [CrossRef] [MathSciNet] [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.