A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks

Published 2010 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks
Authors
Keywords
-
Journal
IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 18, Issue 4, Pages 1067-1076
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Online
2010-01-20
DOI
10.1109/tnet.2009.2038998

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.