Broadcasting in split graphs

DOI10.1007/978-3-031-30448-4_20MaRDI QIDQ6057341

Hovhannes A. Harutyunyan, Narek Hovhannisyan

Publication date: 4 October 2023

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

zbMATH Keywords

interconnection networksapproximation algorithmsbroadcastinginformation dissemination

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimum broadcast time problem for several processor networks
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• Dominating sets for split and bipartite graphs
• Star matching and distance two labelling
• On broadcasting in unicyclic graphs
• Methods and problems of communication in usual networks
• Finding balance: split graphs and related classes
• Split graphs
• Algorithmic graph theory and perfect graphs
• HAMILTONian circuits in chordal bipartite graphs
• Token sliding on split graphs
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Max flows in O(nm) time, or better
• On the history of the transportation and maximum flow problems