A Polynomial Time Algorithm for the 2-Poset Cover Problem
Saved in:
Main Authors: | Ordanel, Ivy, Fernandez, Proceso L, Jr, Adorna, Henry |
---|---|
格式: | text |
出版: |
Archīum Ateneo
2021
|
主題: | |
在線閱讀: | https://archium.ateneo.edu/discs-faculty-pubs/233 https://www.sciencedirect.com/science/article/abs/pii/S002001902100020X#! |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Ateneo De Manila University |
相似書籍
-
On Finding Two Posets that Cover Given Linear Orders
由: Ordanel, Ivy, et al.
出版: (2019) -
Approximation and Computational Complexity of Some Hammock Variations of the Poset Cover Problem
由: Ordanel, Ivy, et al.
出版: (2020) -
Parameterized Algorithm for the Poset Cover Problem
由: Ordanel, Ivy D., et al.
出版: (2024) -
Some Heuristics for the 2-Poset Cover Problem
由: Fernandez, Proceso L, Jr, et al.
出版: (2014) -
Monomial ordering and a division algorithm for polynomials of two or more variables with software
由: Cuaycong, Mark Angelo C., et al.
出版: (1997)