Concepedia

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Yao Guohui, Daming Zhu, Hengwu Li, Shaohan Ma

Discrete Mathematics · 2007 · 10 citations · 22 references

Concepts

ComputingComputer ScienceAlgorithmsCombinatoricsComputer NetworksBroadcast CommunicationCommunication ComplexityDirected Acyclic GraphsGraph AlgorithmsGraph TheoryBroadcastBroadcast AlgorithmsDirected GraphsMinimum Spanning Tree AlgorithmsMinimum Spanning Tree ProblemNode DegreeSpanning Tree ConstructionTree Algorithms

References

22

A survey of gossiping and broadcasting in communication networks

Sandra M. Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman · Networks · 1988 · 1.2K citations

Social Sciences, Communication, Computer Science +14

Methods and problems of communication in usual networks

Pierre Fraigniaud, Emmanuel Lazard · Discrete Applied Mathematics · 1994 · 397 citations

Social Sciences, Communication, Communication Theory +5

Topological design of centralized computer networks—formulations and algorithms

Bezalel Gavish · Networks · 1982 · 259 citations

Computing, Computer Science, Computer Networks +16

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

Martin Fürer, Balaji Raghavachari · Journal of Algorithms · 1994 · 215 citations

Computing, Computer Science, Mathematics +12

Rapid rumor ramification: approximating the minimum broadcast time

R. Ravi · 2002 · 160 citations

Computing, Communication, Computer Science +13