OpenAlex
PricingAboutJobs
Log inGet started
Work

Rapid rumor ramification: approximating the minimum broadcast time

HTML

Year: 2002
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sfcs.1994.365693
Author: R. Ravi
Institutions: Princeton University, Center for Discrete Mathematics and Theoretical Computer Science, University of California, Davis
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: rumor propagation, spanning trees, approximation algorithms, NP-hardness, multicast, distributed networks

Open Access status: closed
OpenAlex ID: W1918603512
FWCI: 6.612
Cites: 31
Cited by: 207
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security