Broadcasting in split graphs
From MaRDI portal
Cites work
- A survey of gossiping and broadcasting in communication networks
- Algorithmic graph theory and perfect graphs
- Dominating sets for split and bipartite graphs
- Finding balance: split graphs and related classes
- HAMILTONian circuits in chordal bipartite graphs
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3910422 (Why is no real title available?)
- scientific article; zbMATH DE number 3652386 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1500531 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Information Dissemination in Trees
- Linear Algorithm for Broadcasting in Unicyclic Graphs
- Max flows in O(nm) time, or better
- 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
- On the history of the transportation and maximum flow problems
- Split graphs
- Star matching and distance two labelling
- The minimum broadcast time problem for several processor networks
- Token sliding on split graphs
Cited in
(7)- Broadcasts in graphs
- scientific article; zbMATH DE number 4141826 (Why is no real title available?)
- scientific article; zbMATH DE number 1792638 (Why is no real title available?)
- Parameterized Complexity of Broadcasting in Graphs
- Finding broadcast 2-centers of a tree under the postal model
- \textsc{Telephone Broadcast} on graphs of treewidth two
- Broadcasting under structural restrictions
This page was built for publication: Broadcasting in split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057341)
