๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal scrambling sets of simple orders

โœ Scribed by J. Spencer

Publisher
Akadmiai Kiad
Year
1972
Tongue
English
Weight
205 KB
Volume
22
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimal non-simple sets in 4D binary ima
Minimal non-simple sets in 4D binary images
โœ C.J. Gau; T. Yung Kong ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

One way to verify that a proposed parallel thinning algorithm ''preserves topology'' is to check that no iteration can ever delete a minimal non-simple (''MNS'') set. This is a practical verification method because few types of set can be MNS without being a component. Ronse, Hall, Ma, and the autho

On minimizing jumps for ordered sets
On minimizing jumps for ordered sets
โœ Ahmad H. Sharary; Nejib Zaguia ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 383 KB

An ordered set P is called K-free if it does not contain a four-element subset {a, b, c, d} such that a <b is the only comparability among these elements. In this paper we present a polynomial algorithm to find the jump number of K-free ordered sets. AMS subject classifications (1980). 06Al& &X15.

Orders of Indescribable Sets
Orders of Indescribable Sets
โœ Alex Hellsten ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer ๐ŸŒ English โš– 166 KB
Minimizing bumps in linear extensions of
Minimizing bumps in linear extensions of ordered sets
โœ Peter C. Fishburn; William V. Gehrlein ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 650 KB

A linear extension x,x2xs ... of a partially ordered set (X, <) has a bump whenever xi < xi+l. We examine the problem of determining linear extensions with as few bumps as possible. Heuristic algorithms for approximate bump minimization are considered. AhfS (MOS) subject classifications (1980). Prim

Minimizing setups in ordered sets of fix
Minimizing setups in ordered sets of fixed width
โœ Charles J. Colbourn; William R. Pulleyblank ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 190 KB

A simply polynomial time algorithm is given for computing the setup number, or jump number, of an ordered set with fixed width. This arises as an interesting application of a polynomial time algorithm for solving a more general weighted problem in precedence constrained scheduling.