Publication

A Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc
2012
Journal Articles

Abstract

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overall computation time of O(nlog n), and n messages of log (3) n+4 bits each.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Distributed Algorithm for Computing the Node Search Number in Trees

Chat with Graph Search

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Exploring High-Performance and Energy-Efficient Architectures for Edge AI-Enabled Applications