Broadcasting and three list subtraction

DOI10.1007/978-981-96-4448-3_11MaRDI QIDQ6899726zbMATH OpenFDO

Authors Hovhannes A. Harutyunyan, Narek Hovhannisyan

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4448-3_11

zbMATH Keywords

broadcastinginformation disseminationinterconnection networkslist subtraction

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A partial k-arboretum of graphs with bounded treewidth
• A survey of gossiping and broadcasting in communication networks
• Approximation Algorithms for Minimum-Time Broadcast
• Bicriteria network design problems
• Broadcasting on cactus graphs
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• Improved approximation for broadcasting in k-path graphs
• Information Dissemination in Trees
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• Methods and problems of communication in usual networks
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• On broadcasting in unicyclic graphs
• Parameterized complexity of broadcasting in graphs

This page was built for publication: Broadcasting and three list subtraction

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