Keywords

Details

Category:

Monographic publication

Type:

rozdział, artykuł w książce - dziele zbiorowym /podręczniku o zasięgu krajowym

Title of issue:

W : Badania i Rozwój Młodych Naukowców w Polsce: Nauki techniczne i inżynieryjne. Część I strony 110 - 115

Language:

Polish

Publication year:

2017

Bibliographic description:

Osula D.: Realizacja zadań w grafie przez grupę mobilnych jednostek// Badania i Rozwój Młodych Naukowców w Polsce: Nauki techniczne i inżynieryjne. Część I/ ed. Jędrzej Nyćkowiak Poznań: Młodzi Naukowcy, 2017, s.110-115

Bibliography: test

1. Literatura (wymieniona alfabetycznie) open in new tab
2. Alpern S, Gal S (2003) The Theory of Search Games and Rendezvous. Kluwer. open in new tab
3. Barriére L, Flocchini P, Fraigniaud P et al. (2002) Capture of an intruder by mobile agents. In Proc. SPAA 200-209. open in new tab
4. Bienstock D, Seymour P (1991) Monotonicity in graph searching. J. Algorithms 12(2): 239-245. open in new tab
5. Brass P, Cabrera-Mora F, Gasparri A et al. (2011) Multirobot Tree and Graph Exploration. IEEE Trans. Robotics 27(4) 707-717. open in new tab
6. Cai J, Flocchini P, Santoro N (2014) Decontaminating a Network from a Black Virus. IJNC 4(1):151- 173. open in new tab
7. Das S, Dereniowski D, Karousatou C (2014) Collaborative Exploration by Energy-Constrained Mobile Robots. Springer International Publishing, 2014 p. 357-369. open in new tab
8. Dereniowski D (2010) Connected searching of weighted trees. Springer Berlin Heidelberg, 2010 p. 330-341. open in new tab
9. Dereniowski D, Disser Y, Kosowski A et al. (2015) Fast collaborative graph exploration. Inf. Comput. 243: 37-49. open in new tab
10. Dereniowski D, Klasing R, Kosowski A et al. (2014) Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. Theoretical Computer Science 608: 219-230. open in new tab
11. Dereniowski D, Pelc A (2014) Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Computing 27(1): 21-38. open in new tab
12. Dynia M, Korzeniowski M, Schindelhauer C (2006) Power-Aware Collective Tree Exploration. In Proc. Architecture of Computing Systems ARCS 2006 341-351. open in new tab
13. Farrugia A, Gasieniec L, Kuszner L et al. (2015) Deterministic Rendezvous in Restricted Graphs. In Proc. SOFSEM 2015 189-200. open in new tab
14. Flocchini P, Huang MJ, Luccio FL (2007) Decontaminating Chordal Rings and Tori Using Mobile Agents. Int. J. Found. Comput. Sci. 18(3): 547-563. open in new tab
15. Flocchini P, Huang MJ, Luccio FL (2008) Decontamination of hypercubes by mobile agents. Wiley- Interscience 52(3): 167-178. open in new tab
16. Fraigniaud P, Gasieniec L, Kowalski DR et al. (2006) Collective tree exploration. Networks 48(3): 166-177. open in new tab
17. Fraigniaud P, Pelc A (2008) Deterministic Rendezvous in Trees with Little Memory. In Proc. Distributed Computing, 22nd International Symposium, DISC 2008 242-256. open in new tab
18. Itkis G, Lin C, Simon J (1995) Deterministic, constant space, self-stabilizing leader election on uniform rings. In Proc. 9th Workshop on Distributed Algorithms 972: 288-302. open in new tab
19. Luccio FL (2008) Contiguous Search Problem in Sierpiński Graphs. Theory of Computing Systems 44(2): 186-204. open in new tab
20. Villadangos JE, Alberto Córdoba A, Federico Fariña F et al. (2005) Efficient Leader Election in Complete Networks. In Proc. 13th Euromicro Workshop on Parallel, Distributed and Network- Based 136-143. open in new tab
21. Zarrad A, Daadaa Y (2013) A Review of Computation Solutions by Mobile Agents in an Unsafe Environment. International Journal of Advanced Computer Science and Applications 4(4). open in new tab

show (21) hide

Verified by:

Gdańsk University of Technology