Projective planes and congestion-free networks

DOI10.1016/S0166-218X(01)00356-0zbMath1002.68007MaRDI QIDQ1613417

Charles J. Colbourn

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

broadcast mediadesign of networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA ⋮ An explicit formula and its fast algorithm for a class of symmetric balanced incomplete block designs

Cites Work

• Quorums from difference covers
• Maximum degree and fractional matchings in uniform hypergraphs
• The packing problem in statistics, coding theory and finite projective spaces
• Maximal arcs in Desarguesian planes of odd order do not exist
• Bus interconnection networks
• The Non-Existence of Finite Projective Planes of Order 10
• On the maximum sizes of certain (k, n)-arcs in finite projective geometries
• Some maximal arcs in finite projective planes
• Abelian varieties over finite fields
• A Note on Restricted Difference Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Projective planes and congestion-free networks