Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Some algorithms based on the dual of Dilworth's theorem

From MaRDI portal
Publication:1100917
Jump to:navigation, search

DOI10.1016/0167-6423(87)90026-8zbMath0641.68107OpenAlexW2028618276MaRDI QIDQ1100917

Anne Kaldewaij

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90026-8


zbMATH Keywords

Dilworth theoremminimal decompositions of partially ordered sets


Mathematics Subject Classification ID

Partial orders, general (06A06) Discrete mathematics in relation to computer science (68R99)


Related Items (2)

Symmetric chain partitions of orthocomplemented posets ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach







This page was built for publication: Some algorithms based on the dual of Dilworth's theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1100917&oldid=13137511"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki