Linear Algorithm for Broadcasting in Unicyclic Graphs

DOI10.1007/978-3-540-73545-8_37MaRDI QIDQ3608862zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Edward Maraachlian

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_37

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On broadcasting in unicyclic graphs
• Constant approximation for broadcasting in k-cycle graph
• Broadcasting on cactus graphs
• Broadcast problem in hypercube of trees
• A linear algorithm for finding the k‐broadcast center of a tree

Cited in

(16)

• On broadcasting in unicyclic graphs
• On linear-time data dissemination in dynamic rooted trees
• Polynomial-time algorithms for minimum-time broadcast in trees
• The complexity of finding a broadcast center
• An efficient heuristic for broadcasting in networks
• Broadcast problem in hypercube of trees
• Information Dissemination in Trees
• Broadcasting on cactus graphs
• Constant approximation for broadcasting in k-cycle graph
• Broadcasting in split graphs
• Approximation algorithms in graphs with known broadcast time of the base graph
• A note to non-adaptive broadcasting
• Improved approximation for broadcasting in k-path graphs
• Broadcasting and three list subtraction
• Broadcasting in stars of cliques
• On the complexity of telephone broadcasting from cacti to bounded pathwidth graphs

This page was built for publication: Linear Algorithm for Broadcasting in Unicyclic Graphs

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