Abstract
Fault tolerance refers to the ability of a system to continue functioning even if some of its components fail. This concept is fundamental in several domains because reliability and continuous operation are essential in carrying out their functions. Graph embedding means mapping a graph into some other structure that preserves some of the properties or relations held by the original graph. Applications in machine learning, data mining, and network analysis make fault-tolerant embedding of graphs a crucial topic. In this paper, fault-tolerant embeddings are proposed in Archimedean tessellations. The path in the embeddings does not intersect or overlap.
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
Disclaimer: 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.
