scientific article; zbMATH DE number 2068168

zbMATH Open1091.68558MaRDI QIDQ4464786FDOQ4464786

Authors: Hovhannes A. Harutyunyan, Bin Shao 

Publication date: 27 May 2004

Title of this publication is not available (Why is that?)

Recommendations

• A linear algorithm for finding the k‐broadcast center of a tree
• An optimal algorithm for broadcasting multiple messages in trees
• \(k\)-broadcasting in trees
• Local broadcasting in a tree under minisum criterion
• Nonadaptive broadcasting in trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (12)

• A linear algorithm for finding the k‐broadcast center of a tree
• Local broadcasting in a tree under minisum criterion
• Nonadaptive broadcasting in trees
• Minimizing broadcast costs under edge reductions in tree networks
• Information dissemination in weighted trees
• Optimal broadcasting with universal lists based on competitive analysis*
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• \(k\)-broadcasting in trees
• Title not available (Why is that?)
• An optimal algorithm for broadcasting multiple messages in trees
• The shared broadcast tree problem and MST
• \(k\)-port line broadcasting in trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464786)