Title of article :
Projective planes and congestion-free networks Original Research Article
Author/Authors :
Charles J. Colbourn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
10
From page :
117
To page :
126
Abstract :
The design of networks using broadcast media so that every two sites lie on a common link, subject to constraints on the number of links at each site (degree), and the number of sites on each link (link size), is examined. A method proposed by Yener et al. is shown to fail, in general, to achieve the minimum link size for a specified degree constraint. The existence of (k,n)-arcs in projective planes is employed to improve upon their results.
Journal title :
Discrete Applied Mathematics
Serial Year :
2002
Journal title :
Discrete Applied Mathematics
Record number :
885449
Link To Document :
بازگشت