FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W162079933> ?p ?o ?g. }

• W162079933 abstract "In this thesis we study the problem of parallel graph exploration using multiple synchronized mobile agents. Each mobile agent is an entity that can, independently of other agents, visit vertices of the graph and traverse its edges. The goal of the agents is to visit all vertices of the graph. We first study graph exploration in the model where agents are equipped with internal memory but no memory is available at the nodes. Agents in this model are also allowed to communicate between each other by exchanging messages. We present algorithms working in a minimal possible time for a team of polynomial size (in the number of vertices of the graph). We also study the impact of the available range of communication by analysing algorithms for agents which can communicate at arbitrary distance, or only with other agents located at the same node. We present efficient algorithms and lower bounds that almost match our positive results in both communication models. We also consider graph exploration when movements of agents are determined according to the so-called rotor-router mechanism. From the perspective of a fixed node, the rotor-router sends out agents which visit the node along its outgoing edges, in a round-robin fashion. We study the speedup which is the ratio between the worst-case exploration of a single agent and of multiple agents. We first show that the speedup for general graphs for the multi-agent rotor-router is always between logarithmic and linear in the number of agents. We also present a tight analysis of the speedup for the multi-agent rotor-router for cycles, expanders, random graphs, cliques, constant dimensional tori and an almost-tight analysis for hypercubes. Finally we consider collision-free exploration, where each agent has to explore the graph independently with the additional constraint that no two agents can occupy the same node at the same time. In the case when agents are given the map of the graph, we show an optimal algorithm for trees and an asymptotically optimal algorithm for general graphs. We also present algorithms for collision-free exploration of trees and general graphs in the case when agents have no initial knowledge about the graph. We close the thesis with concluding remarks and a discussion of related open problems in the area of graph exploration." @default.
• W162079933 created "2016-06-24" @default.
• W162079933 creator A5027015215 @default.
• W162079933 date "2014-06-13" @default.
• W162079933 modified "2023-09-24" @default.
• W162079933 title "Algorithms for deterministic parallel graph exploration" @default.
• W162079933 cites W1479919623 @default.
• W162079933 cites W1494314796 @default.
• W162079933 cites W1495764901 @default.
• W162079933 cites W1496690131 @default.
• W162079933 cites W1501957312 @default.
• W162079933 cites W1505062846 @default.
• W162079933 cites W1513799234 @default.
• W162079933 cites W1514107797 @default.
• W162079933 cites W1528015603 @default.
• W162079933 cites W1530420645 @default.
• W162079933 cites W1537458717 @default.
• W162079933 cites W1543762072 @default.
• W162079933 cites W1550461971 @default.
• W162079933 cites W1551321261 @default.
• W162079933 cites W1552591469 @default.
• W162079933 cites W1560056020 @default.
• W162079933 cites W1578829633 @default.
• W162079933 cites W1586184796 @default.
• W162079933 cites W1588736092 @default.
• W162079933 cites W1592126212 @default.
• W162079933 cites W1600293573 @default.
• W162079933 cites W1603204637 @default.
• W162079933 cites W1635699204 @default.
• W162079933 cites W1636188677 @default.
• W162079933 cites W1643282477 @default.
• W162079933 cites W1676511350 @default.
• W162079933 cites W1728603878 @default.
• W162079933 cites W1850102572 @default.
• W162079933 cites W1879436584 @default.
• W162079933 cites W1909387666 @default.
• W162079933 cites W1910061521 @default.
• W162079933 cites W1965243636 @default.
• W162079933 cites W1967767406 @default.
• W162079933 cites W1969585469 @default.
• W162079933 cites W1972775782 @default.
• W162079933 cites W1973367602 @default.
• W162079933 cites W1975531816 @default.
• W162079933 cites W1975911106 @default.
• W162079933 cites W1980155648 @default.
• W162079933 cites W1980368207 @default.
• W162079933 cites W1980467795 @default.
• W162079933 cites W1981557449 @default.
• W162079933 cites W1981643246 @default.
• W162079933 cites W1982129592 @default.
• W162079933 cites W1984719907 @default.
• W162079933 cites W1987834484 @default.
• W162079933 cites W1988551609 @default.
• W162079933 cites W1988782771 @default.
• W162079933 cites W1988889787 @default.
• W162079933 cites W1990101796 @default.
• W162079933 cites W1991528957 @default.
• W162079933 cites W1994392346 @default.
• W162079933 cites W1995273909 @default.
• W162079933 cites W1997429681 @default.
• W162079933 cites W1998007106 @default.
• W162079933 cites W1998756491 @default.
• W162079933 cites W1999053910 @default.
• W162079933 cites W2001165134 @default.
• W162079933 cites W2002921350 @default.
• W162079933 cites W2003811039 @default.
• W162079933 cites W2006397962 @default.
• W162079933 cites W2011039300 @default.
• W162079933 cites W2013854554 @default.
• W162079933 cites W2015331738 @default.
• W162079933 cites W2017617294 @default.
• W162079933 cites W2017716370 @default.
• W162079933 cites W2020796742 @default.
• W162079933 cites W2025264288 @default.
• W162079933 cites W2027188157 @default.
• W162079933 cites W2028400828 @default.
• W162079933 cites W2030026014 @default.
• W162079933 cites W2031698396 @default.
• W162079933 cites W2035206572 @default.
• W162079933 cites W2039936247 @default.
• W162079933 cites W2044484214 @default.
• W162079933 cites W2044973122 @default.
• W162079933 cites W2046635105 @default.
• W162079933 cites W2046919262 @default.
• W162079933 cites W2048090017 @default.
• W162079933 cites W2048572907 @default.
• W162079933 cites W2049516232 @default.
• W162079933 cites W2053831174 @default.
• W162079933 cites W2055505431 @default.
• W162079933 cites W2058824252 @default.
• W162079933 cites W2066700938 @default.
• W162079933 cites W2069950735 @default.
• W162079933 cites W2072637783 @default.
• W162079933 cites W2072757898 @default.
• W162079933 cites W2077415032 @default.
• W162079933 cites W2077944048 @default.
• W162079933 cites W2079729465 @default.
• W162079933 cites W2080310439 @default.
• W162079933 cites W2081055073 @default.
• W162079933 cites W2084346109 @default.

• next