Algorithmic Counting of Types of UPO Graphs and PosetsBayoumi I. Bayoumi, Mohamed H. El-Zahar ; Khamis, Soheir
AbstractIn this paper we describe an algorithm for counting unlabeled prime posets and unlabeled UPO graph. The algorithm generates precedence matrices of posets and tests them are : matrices are generated in a pseudo-lexicographic order and no storing of previously generated matrices is required . Numerical results up to eleven elements are included
|Keywords||: algorithm , counting , enumeration , prime posets , UPO graphs .||Issue Date||1997||Journal||Congressus Numeratium||URI||http://research.asu.edu.eg/123456789/1140|
Recommend this item
|Algorithmic Counting of Types of UPO Graphs and Posets.pdf||68.59 MB||Adobe PDF||View/Open|
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.