Matches in SemOpenAlex for { <https://semopenalex.org/work/W4386786275> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W4386786275 endingPage "114187" @default.
- W4386786275 startingPage "114187" @default.
- W4386786275 abstract "We present the problem of finding a maximal independent set (MIS) (named as MIS Filling problem) of an arbitrary connected graph having n vertices with luminous myopic mobile robots. The robots enter the graph one after another from a particular vertex called the Door and move along the edges of the graph without collision to occupy vertices such that the set of occupied vertices form a maximal independent set. In this paper, we explore two versions of the MIS filling problem, where two separate algorithms are proposed. First version of the problem considers a Single Door where our IND algorithm forms an MIS of size m in O(m2) epochs under an asynchronous scheduler, where an epoch is the smallest time interval in which each participating robot gets activated at least once and performs a Look-Compute-Move cycle. The robots have three hops of visibility range, Δ+8 number of colors, and O(logΔ) bits of persistent storage, where Δ is the maximum degree of the graph. The second version of the problem has Multiple Doors for which we present our MULTIND algorithm that forms an MIS in O(m2) epochs under a semi-synchronous scheduler using robots with five hops of visibility range, Δ+k+7 number of colors, and O(log(Δ+k)) bits of persistent storage, where k is the number of Doors. We also achieve a lower bound of Ω(n) for MIS filling problem with Single Door, where n is the number of vertices of the graph." @default.
- W4386786275 created "2023-09-16" @default.
- W4386786275 creator A5005878475 @default.
- W4386786275 creator A5015767210 @default.
- W4386786275 creator A5027857227 @default.
- W4386786275 creator A5029020046 @default.
- W4386786275 date "2023-11-01" @default.
- W4386786275 modified "2023-10-02" @default.
- W4386786275 title "Distributed Algorithms for Filling MIS Vertices of an Arbitrary Graph by Myopic Luminous Robots" @default.
- W4386786275 cites W2005449022 @default.
- W4386786275 cites W2008110774 @default.
- W4386786275 cites W2965788437 @default.
- W4386786275 cites W3012558506 @default.
- W4386786275 cites W3094409800 @default.
- W4386786275 cites W3182674124 @default.
- W4386786275 doi "https://doi.org/10.1016/j.tcs.2023.114187" @default.
- W4386786275 hasPublicationYear "2023" @default.
- W4386786275 type Work @default.
- W4386786275 citedByCount "0" @default.
- W4386786275 crossrefType "journal-article" @default.
- W4386786275 hasAuthorship W4386786275A5005878475 @default.
- W4386786275 hasAuthorship W4386786275A5015767210 @default.
- W4386786275 hasAuthorship W4386786275A5027857227 @default.
- W4386786275 hasAuthorship W4386786275A5029020046 @default.
- W4386786275 hasConcept C11413529 @default.
- W4386786275 hasConcept C114614502 @default.
- W4386786275 hasConcept C118615104 @default.
- W4386786275 hasConcept C132525143 @default.
- W4386786275 hasConcept C134306372 @default.
- W4386786275 hasConcept C151319957 @default.
- W4386786275 hasConcept C154945302 @default.
- W4386786275 hasConcept C31258907 @default.
- W4386786275 hasConcept C33923547 @default.
- W4386786275 hasConcept C41008148 @default.
- W4386786275 hasConcept C63553672 @default.
- W4386786275 hasConcept C77553402 @default.
- W4386786275 hasConcept C80899671 @default.
- W4386786275 hasConcept C90509273 @default.
- W4386786275 hasConceptScore W4386786275C11413529 @default.
- W4386786275 hasConceptScore W4386786275C114614502 @default.
- W4386786275 hasConceptScore W4386786275C118615104 @default.
- W4386786275 hasConceptScore W4386786275C132525143 @default.
- W4386786275 hasConceptScore W4386786275C134306372 @default.
- W4386786275 hasConceptScore W4386786275C151319957 @default.
- W4386786275 hasConceptScore W4386786275C154945302 @default.
- W4386786275 hasConceptScore W4386786275C31258907 @default.
- W4386786275 hasConceptScore W4386786275C33923547 @default.
- W4386786275 hasConceptScore W4386786275C41008148 @default.
- W4386786275 hasConceptScore W4386786275C63553672 @default.
- W4386786275 hasConceptScore W4386786275C77553402 @default.
- W4386786275 hasConceptScore W4386786275C80899671 @default.
- W4386786275 hasConceptScore W4386786275C90509273 @default.
- W4386786275 hasLocation W43867862751 @default.
- W4386786275 hasOpenAccess W4386786275 @default.
- W4386786275 hasPrimaryLocation W43867862751 @default.
- W4386786275 hasRelatedWork W114411412 @default.
- W4386786275 hasRelatedWork W1719252778 @default.
- W4386786275 hasRelatedWork W1974452921 @default.
- W4386786275 hasRelatedWork W2031098440 @default.
- W4386786275 hasRelatedWork W2059680011 @default.
- W4386786275 hasRelatedWork W2905721092 @default.
- W4386786275 hasRelatedWork W2952492560 @default.
- W4386786275 hasRelatedWork W4300632873 @default.
- W4386786275 hasRelatedWork W4307385446 @default.
- W4386786275 hasRelatedWork W4386875525 @default.
- W4386786275 hasVolume "978" @default.
- W4386786275 isParatext "false" @default.
- W4386786275 isRetracted "false" @default.
- W4386786275 workType "article" @default.