The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks

Simple item page
dc.creatorSethu, Harish
dc.date2007-09-06
dc.date.accessioned2026-07-07T08:28:07Z
dc.date.available2026-07-07T08:28:07Z
dc.descriptionIn this report, we consider maximal solutions to the induced bounded-degree subgraph problem and relate it to issues concerning stream control in multiple-input multiple-output (MIMO) networks. We present a new distributed algorithm that completes in logarithmic time with high probability and is guaranteed to complete in linear time. We conclude the report with simulation results that address the effectiveness of stream control and the relative impact of receiver overloading and flexible interference suppression.
dc.identifierhttps://arxiv.org/abs/0709.0965
dc.identifierhttp://arxiv.org/abs/0709.0965
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137504
dc.subjectNetworking and Internet Architecture
dc.titleThe Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks
dc.typetext

Files

Collections

arXiv