ISSN:
0364-9024
eISSN:
1097-0118
Disciplines
(Field of Science):
- computer and information sciences (Natural sciences)
- mathematics (Natural sciences)
Ministry points: Help
Year | Points | List |
---|---|---|
Year 2024 | 140 | Ministry scored journals list 2024 |
Year | Points | List |
---|---|---|
2024 | 140 | Ministry scored journals list 2024 |
2023 | 140 | Ministry Scored Journals List |
2022 | 140 | Ministry Scored Journals List 2019-2022 |
2021 | 140 | Ministry Scored Journals List 2019-2022 |
2020 | 140 | Ministry Scored Journals List 2019-2022 |
2019 | 140 | Ministry Scored Journals List 2019-2022 |
2018 | 30 | A |
2017 | 30 | A |
2016 | 30 | A |
2015 | 25 | A |
2014 | 30 | A |
2013 | 25 | A |
2012 | 25 | A |
2011 | 25 | A |
2010 | 27 | A |
Model:
Hybrid
Points CiteScore:
Year | Points |
---|---|
Year 2023 | 1.6 |
Year | Points |
---|---|
2023 | 1.6 |
2022 | 1.6 |
2021 | 1.7 |
2020 | 2 |
2019 | 1.8 |
2018 | 1.6 |
2017 | 1.5 |
2016 | 1.7 |
2015 | 1.9 |
2014 | 1.6 |
2013 | 1.6 |
2012 | 1.4 |
2011 | 1.4 |
Impact Factor:
Log in to see the Impact Factor.
Sherpa Romeo:
Papers published in journal
Filters
total: 1
Catalog Journals
Year 2012
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
seen 518 times