An algorithm to generate the ideals of a partial order |
| |
| Affiliation: | 1. Department of Mathematics, Federal University of Rio Grande do Norte, 59072-970, Brazil;2. Department of Informatics and Applied Mathematics, Federal University of Rio Grande do Norte, 59072-970, Brazil;1. Department of Applied Math. (IMECC-UNICAMP), University of Campinas, Campinas, SP 13081-970, Brazil;2. Department of Statistics and Applied Mathematics, Federal University of Ceará, Fortaleza, CE 60440-900, Brazil;3. Department of Applied Mathematics, Rio de Janeiro State University, Rio de Janeiro, RJ 20559-900, Brazil;4. Department of Mathematics, Federal University of Santa Catarina, Florianópolis, SC 88040-900, Brazil;5. IRISA, University of Rennes 1, Rennes, F-35042, France;1. Section of Hematology-Oncology, Department of Medicine, Baylor College of Medicine, Houston, Texas;2. Clinical Research Division, Fred Hutchinson Cancer Research Center, Seattle, Washington;3. School of Medicine, Baylor College of Medicine, Houston, Texas;4. Division of Epidemiology and Population Science, Baylor College of Medicine, Houston, Texas;5. Institute of Clinical and Translational Medicine, Baylor College of Medicine, Houston, Texas;6. Division of Nephrology, Seattle Children''s Hospital, Seattle, Washington;7. Division of Medical Oncology, Department of Medicine, University of Washington School of Medicine, Seattle, Washington;8. Department of Pediatrics, University of Washington School of Medicine, Seattle, Washington |
| |
| Abstract: | Generating the ideals of a partially ordered set is an important, frequently occurring problem in scheduling, reliability, sensitivity analysis for network flows and other combinatorial optimization problems. In this paper we present an algorithm which generates all the ideals of a partial order on n elements in O(n) time per ideal. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
