The complexity of broadcasting in planar and decomposable graphs

Authors:
Andreas Jakoby;Rüdiger Reischuk;Christian Schindelhauer
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Year:
1998

Citing 0
Cited 2

On the inapproximability of broadcasting time

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Broadcasting in necklace graphs

C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract