ISSN:
0988-3754
eISSN:
1290-385X
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- management and quality studies (Social studies)
- computer and information sciences (Natural sciences)
(Field of Science)
Ministry points: Help
Year | Points | List |
---|---|---|
Year 2024 | 40 | Ministry scored journals list 2024 |
Year | Points | List |
---|---|---|
2024 | 40 | Ministry scored journals list 2024 |
2023 | 40 | Ministry Scored Journals List |
2022 | 40 | Ministry Scored Journals List 2019-2022 |
2021 | 40 | Ministry Scored Journals List 2019-2022 |
2020 | 40 | Ministry Scored Journals List 2019-2022 |
2019 | 40 | Ministry Scored Journals List 2019-2022 |
2018 | 15 | A |
2017 | 15 | A |
2016 | 15 | A |
2015 | 15 | A |
2014 | 15 | A |
2013 | 15 | A |
2012 | 15 | A |
2011 | 15 | A |
2010 | 20 | A |
Model:
Hybrid
Points CiteScore:
Year | Points |
---|---|
Year 2023 | 0.8 |
Year | Points |
---|---|
2023 | 0.8 |
2022 | 1.1 |
2021 | 0.8 |
2020 | 0.7 |
2019 | 1 |
2018 | 1 |
2017 | 1.1 |
2016 | 0.8 |
2015 | 1.3 |
2014 | 1.1 |
2013 | 1.1 |
2012 | 1.3 |
2011 | 1.1 |
Impact Factor:
Log in to see the Impact Factor.
Sherpa Romeo:
Papers published in journal
Filters
total: 2
Catalog Journals
Year 2013
-
Minimal 2-dominating sets in Trees
PublicationWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
Year 2009
-
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
PublicationWe describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions that are unique) for every input...
seen 270 times