Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.

From MaRDI portal
Publication:2454050

DOI10.1007/S11083-013-9292-6zbMATH Open1302.06004arXiv1208.2180OpenAlexW2145635797MaRDI QIDQ2454050FDOQ2454050


Authors: Marcel Wild Edit this on Wikidata


Publication date: 12 June 2014

Published in: Order (Search for Journal in Brave)

Abstract: The N cardinality k ideals of any w-element poset (w, k variable) can be enumerated in time O(Nw^3). The corresponding bound for k-element subtrees of a w-element tree is O(Nw^5). An algorithm is described that by the use of wildcards displays all order ideals of a poset in a compact manner, i.e. not one by one.


Full work available at URL: https://arxiv.org/abs/1208.2180




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454050)