Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- automation, electronics, electrical engineering and space technologies (Engineering and Technology)
- information and communication technology (Engineering and Technology)
- computer and information sciences (Natural sciences)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 70 | Ministry scored journals list 2024 |
| 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 | 15 | A |
| 2013 | 25 | A |
| 2012 | 35 | A |
| 2011 | 35 | A |
| 2010 | 32 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 3.2 |
| Year | Points |
|---|---|
| 2023 | 3.2 |
| 2022 | 3.7 |
| 2021 | 3.8 |
| 2020 | 3.7 |
| 2019 | 3.2 |
| 2018 | 2.6 |
| 2017 | 2.2 |
| 2016 | 1.9 |
| 2015 | 2.7 |
| 2014 | 2.4 |
| 2013 | 2.5 |
| 2012 | 2.1 |
| 2011 | 2.5 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 5
Catalog Journals
Year 2015
-
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
Year 2014
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
Time versus space trade-offs for randezvous in trees
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...
Year 2012
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationProblem rendezvous został dogłębnie zbadany, zarówno dla agendów anonimowych jak i poetykietowanych. zbadano też problem eksploracji grafu za pomocą agentów mobilnych.
Year 2011
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
seen 506 times