AI Assistant
Blog
Pricing
Log In
Sign Up
A greedy approximation algorithm for the minimum (2,2)-connected dominating set problem
Details
Cite
Export
Add to List
The content you want is available to Zendy users.
Already have an account? Click
here.
to sign in.