Optimal deterministic algorithm for the hammock (2,2)-poset cover problem

Optimal deterministic algorithm for the hammock (2,2)-poset cover problem

Show all versions (4)

The Poset Cover Problem is a hard optimization problem that has application to problems in data mining where the goal is to come up with directed acyclic networks that characterize the ordering pattern of a given set of sequential data. There have been variations to the problem, one of which is the...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Ordanel, Ivy D. (Awdur), Adorna, Henry N. (Awdur)
Fformat: Analytics
Iaith:English
Cyhoeddwyd: 2018.
Pynciau:
Computer science.
Algorithm.
Partial order.
Poset.
Mynediad Ar-lein:https://forms.gle/KZjBv7aRtY6jiL5E9