Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 2079403

From MaRDI portal
Publication:4471362
Jump to:navigation, search

zbMath1092.68730MaRDI QIDQ4471362

Aravind Srinivasan, Devdatt P. Dubhashi, Alessandro Mei, Jaikumar Radhakrishnan, Alessandro Panconesi

Publication date: 28 July 2004


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Distributed algorithms (68W15)


Related Items (8)

Revisiting connected dominating sets: an almost optimal local information algorithm ⋮ Constructing weakly connected dominating set for secure clustering in distributed sensor network ⋮ Bounds relating the weakly connected domination number to the total domination number and the matching number ⋮ A self-stabilizing algorithm for constructing weakly connected minimal dominating sets ⋮ Constant-time distributed dominating set approximation ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems ⋮ Connected domination of regular graphs ⋮ Approximation algorithms for channel allocation problems in broadcast networks




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4471362&oldid=18541244"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 07:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki