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

标题
A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks
作者
关键词
-
出版物
IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 18, Issue 4, Pages 1067-1076
出版商
Institute of Electrical and Electronics Engineers (IEEE)
发表日期
2010-01-20
DOI
10.1109/tnet.2009.2038998

向作者/读者发起求助以获取更多资源

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now