Broadcasting on cactus graphs

DOI10.1007/s10878-015-9957-8zbMath1365.05268OpenAlexW2179357869MaRDI QIDQ512890

Maja Čevnik, Janez Žerovnik

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9957-8

zbMATH Keywords

broadcastingbroadcast centercactus graphbroadcast schemebroadcast time

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (2)

The complexity of finding a broadcast center ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On broadcasting in unicyclic graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• The obnoxious center problem on weighted cactus graphs.
• An efficient heuristic for broadcasting in networks
• Distance distributions for graphs modeling computer networks
• Sublogarithmic approximation for telephone multicast
• Centdian Computation in Cactus Graphs
• Randomized broadcast in networks
• Information Dissemination in Trees
• Graph Classes: A Survey
• Approximation Algorithms for Minimum-Time Broadcast
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

This page was built for publication: Broadcasting on cactus graphs