Time-Optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Time-Optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph
Συγγραφείς: Jana, SaswataAff9, Pramanick, SubhajitAff9, Bhattacharya, AdriAff9, Mandal, Partha SarathiAff9
Συνεισφορές: Goos, Gerhard, Founding EditorAff1, Hartmanis, Juris, Founding EditorAff2, Bertino, Elisa, Series EditorAff3, Gao, Wen, Series EditorAff4, Steffen, Bernhard, Series EditorAff5, Yung, Moti, Series EditorAff6, Michail, Othon, editorAff7, Prencipe, Giuseppe, editorAff8
Πηγή: Algorithmics of Wireless Networks : 21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September 18–19, 2025, Proceedings. 16078:135-150
Βάση Δεδομένων: Springer Nature eBooks
Περιγραφή
ISBN:9783032091192
9783032091208
DOI:10.1007/978-3-032-09120-8_10