✦ LIBER ✦

A circuit set characterization of antimatroids

✍ Scribed by Brenda L Dietrich

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 465 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90007-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic characterization of antim

An algorithmic characterization of antimatroids

✍ E.Andrew Boyd; Ulrich Faigle 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Characterizations of polygreedoids and p

Characterizations of polygreedoids and poly-antimatroids by greedy algorithms

✍ Masataka Nakamura 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 181 KB

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

Circuits including a given set of vertic

Circuits including a given set of vertices

✍ Pierre Fraisse 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

Let G = (V, €) be a digraph of order n, satisfying Woodall's condition Let S be a subset of V of cardinality s. Then there exists a circuit including S and of length at most Min(n,2s). In the case of oriented graphs we obtain the same result under the weaker condition d'(x) + d-( y) 2 n -2 (which i