Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.
Hedetniemi, Stephen T
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.
citing papers explorer
-
A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
Presents a linear-time (1.5-ε)-approximation algorithm for the broadcast time problem on k-cycle graphs.
-
Open Problems in a Logic of Gossips
This paper compiles and discusses several open problems in the modal logic for gossip protocols that use epistemic formulas.