A Polynomial Time Algorithm for the 2-Poset Cover Problem
Saved in:
Main Authors: | Ordanel, Ivy, Fernandez, Proceso L, Jr, Adorna, Henry |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2021
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/discs-faculty-pubs/233 https://www.sciencedirect.com/science/article/abs/pii/S002001902100020X#! |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
On Finding Two Posets that Cover Given Linear Orders
by: Ordanel, Ivy, et al.
Published: (2019) -
Approximation and Computational Complexity of Some Hammock Variations of the Poset Cover Problem
by: Ordanel, Ivy, et al.
Published: (2020) -
Parameterized Algorithm for the Poset Cover Problem
by: Ordanel, Ivy D., et al.
Published: (2024) -
Some Heuristics for the 2-Poset Cover Problem
by: Fernandez, Proceso L, Jr, et al.
Published: (2014) -
Monomial ordering and a division algorithm for polynomials of two or more variables with software
by: Cuaycong, Mark Angelo C., et al.
Published: (1997)