𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithmic characterization of antimatroids

✍ Scribed by E.Andrew Boyd; Ulrich Faigle

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
626 KB
Volume
28
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The forbidden minor characterization of
The forbidden minor characterization of line-search antimatroids of rooted digraphs
✍ Yoshio Okamoto; Masataka Nakamura πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 303 KB

An antimatroid is an accessible union-closed family of subsets of a ΓΏnite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling ant

Excluded-minor characterizations of anti
Excluded-minor characterizations of antimatroids arisen from posets and graph searches
✍ M. Nakamura πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 161 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an 'antipodal' concept of matroid. We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphi

Excluded–Minor Characterizations of Anti
Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
✍ M. Nakamura πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 616 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is a 'dual' or 'antipodal' concept of matroill. We shall show that an antimatroid is derived from shelling of a poset if and only if it. docs not contain a mino