Abstract
Mosaics are planar graphs with vertices labelled with nonnegative integers. In a mosaic, vertices labelled with 0 represent empty places (holes); vertices labelled with positive integers are interpreted as places occupied by pieces with colour indicated by their labels. A distributed algorithm for choosing a single piece of mosaic is given, provided the mosaic is finite, triangular, and has nonempty and connected sets of holes and pieces. Correctness of the algorithm of removing pieces from mosaics is proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
