ALGORITHMICA - Journal - Bridge of Knowledge

Your account

login

Search

ALGORITHMICA

ISSN:

0178-4617

eISSN:

1432-0541

Disciplines
(Field of Science):

  • information and communication technology (Engineering and Technology)
  • biomedical engineering (Engineering and Technology)
  • computer and information sciences (Natural sciences)
  • mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 70 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 70 Ministry scored journals list 2024
2023 70 Ministry Scored Journals List
2022 70 Ministry Scored Journals List 2019-2022
2021 70 Ministry Scored Journals List 2019-2022
2020 70 Ministry Scored Journals List 2019-2022
2019 70 Ministry Scored Journals List 2019-2022
2018 25 A
2017 25 A
2016 25 A
2015 20 A
2014 20 A
2013 25 A
2012 30 A
2011 30 A
2010 27 A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2023 2.8
Points CiteScore - previous years
Year Points
2023 2.8
2022 2.7
2021 2.7
2020 2.6
2019 2.4
2018 2.3
2017 2.3
2016 2.3
2015 2.7
2014 2.4
2013 2.5
2012 2.1
2011 1.8

Impact Factor:

Log in to see the Impact Factor.

Sherpa Romeo:

https://v2.sherpa.ac.uk/id/publication/16620

Papers published in journal

Filters

total: 4

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2023
  • Complexity Issues on of Secondary Domination Number
    Publication

    - ALGORITHMICA - Year 2023

    In this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...

    Full text available to download

Year 2012
  • Graph Decomposition for Memoryless Periodic Exploration
    Publication

    - ALGORITHMICA - Year 2012

    We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...

    Full text to download in external service

Year 2009
  • Incremental construction of Minimal Tree Automata [online]
    Publication

    - ALGORITHMICA - Year 2009

    We describe an algorithm that allows the incremental addition or removal of unranked ordered trees to minimal frontier-to-root deterministic tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a minimal DTA A' which accepts the language L(A) accepted by A incremented (or decremented) with the tree t. The algorithm can be used to efficiently maintain dictionaries which store large collections...

    Full text to download in external service

Year 2004

seen 516 times