Fault-Tolerant Graph Realizations in the Congested Clique, Revisited

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

We study the graph realization problem in the Congested Clique in a distributed network under the crash-fault model. We focus on the degree-sequence realization, each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. This paper focuses on the message and round complexity of deterministic graph realization in the anonymous network. It has been shown by Kumar et al. [ALGOSENSORS 2022] that the graph realization can be solved using message and O(f) round without the knowledge of f, of which f nodes could be faulty f

First Page

84

Last Page

97

DOI

10.1007/978-3-031-24848-1_6

Publication Date

1-1-2023

This document is currently not available here.

Share

COinS