Abstract
A family of sets is said to have property B(s) if there is a set, referred to as a blocking set, whose intersection with each member of the family is a proper subset of that blocking set and contains fewer than s elements. A finite projective plane is a construction satisfying the two conditions that any two lines meet in a unique point and any two points are on a unique line. In this paper, the authors develop an algorithm of complexity O(n3) for constructing a blocking set for a projective plane of order n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computational Geometry & Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.