arXiv Open Access 2017

An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes

Marcel Wild

Lihat Sumber

Abstrak

Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideals are inferred from the corresponding numbers of the k-element (order) ideals. Crucial in all of this is a compressed representation (using wildcards) of the ideal lattice. The whole scheme invites distributed computation.

Topik & Kata Kunci

cs.DS

Penulis (1)

Marcel Wild

Format Sitasi

APA MLA BibTeX

Wild, M. (2017). An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes. https://arxiv.org/abs/1704.07708

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓