{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:01:45Z","timestamp":1648533705265},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,8]]},"abstract":"<jats:p> In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower bounds as well as some necessary conditions. We also propose an algorithm that is asymptotically optimal in both space and round complexities. <\/jats:p>","DOI":"10.1142\/s012905411100860x","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T09:42:53Z","timestamp":1312969373000},"page":"1143-1159","source":"Crossref","is-referenced-by-count":0,"title":["ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS"],"prefix":"10.1142","volume":"22","author":[{"given":"FABIENNE","family":"CARRIER","sequence":"first","affiliation":[{"name":"VERIMAG UMR 5104, Universit\u00e9 Joseph Fourier, Grenoble I, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ST\u00c9PHANE","family":"DEVISMES","sequence":"additional","affiliation":[{"name":"VERIMAG UMR 5104, Universit\u00e9 Joseph Fourier, Grenoble I, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCK","family":"PETIT","sequence":"additional","affiliation":[{"name":"LIP6 UMR 7606, Universit\u00e9 Pierre et Marie Curie, Paris VI, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YVAN","family":"RIVIERRE","sequence":"additional","affiliation":[{"name":"VERIMAG UMR 5104, Universit\u00e9 Joseph Fourier, Grenoble I, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"rf4","volume-title":"Graphes","author":"Berge C.","year":"1983"},{"key":"rf6","first-page":"3","volume":"20","author":"Bui A.","journal-title":"Distributed Computing"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.005"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/71.588622"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.032"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/s11741-004-0036-0"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411100860X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:33:36Z","timestamp":1565138016000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411100860X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":7,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,8]]}},"alternative-id":["10.1142\/S012905411100860X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411100860x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}