Algorithmic Counting of Types of UPO Graphs and Posets

Bayoumi I. Bayoumi, Mohamed H. El-Zahar ; Khamis, Soheir 


In 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

Other data

Keywords : algorithm , counting , enumeration , prime posets , UPO graphs .
Issue Date 1997
Journal Congressus Numeratium 

Recommend this item

CORE Recommender

Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.