Algorithmic Counting of Types of UPO Graphs and Posets
Bayoumi I. Bayoumi, Mohamed H. El-Zahar; Khamis, Soheir;
Abstract
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
Numerical results up to eleven elements are included
Other data
| Title | Algorithmic Counting of Types of UPO Graphs and Posets | Authors | Bayoumi I. Bayoumi, Mohamed H. El-Zahar ; Khamis, Soheir | Keywords | : algorithm , counting , enumeration , prime posets , UPO graphs . | Issue Date | 1997 | Journal | Congressus Numeratium |
Attached Files
| File | Description | Size | Format | |
|---|---|---|---|---|
| Algorithmic Counting of Types of UPO Graphs and Posets.pdf | 68.59 MB | Adobe PDF | View/Open |
Similar Items from Core Recommender Database
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.