Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimum algorithm for the mutual visibility problem

From MaRDI portal
Publication:782150
Jump to:navigation, search

DOI10.1007/978-3-030-39881-1_4OpenAlexW3003575917MaRDI QIDQ782150

Subhash Bhagat

Publication date: 22 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39881-1_4


zbMATH Keywords

synchronousswarm robotsmutual visibility problempersistent memory


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)


Related Items (6)

Mutual visibility in graphs ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Variety of mutual-visibility problems in graphs ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Mutual-visibility sets in Cartesian products of paths and cycles ⋮ On the mutual visibility in Cartesian products and triangle-free graphs




This page was built for publication: Optimum algorithm for the mutual visibility problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:782150&oldid=12708643"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki