Results 11 to 20 of about 114 (83)
Cooperative games on antimatroids [PDF]
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Encarnación Algaba Durán +3 more
openaire +8 more sources
A single-element extension of antimatroids [PDF]
Discrete Applied Mathematics, 2002 An ``antimatroid'' is a finite set together with a closure operator which satisfies the ``anti-exchange property.'' (Closure operators of matroids satisfy the ``exchange property.'' The definition used in this paper is based on the set of complements of closed sets of the antimatroid.) Let \(\mathcal A\) be an antimatroid on \(E\), \(p \in E\), and ...
Nakamura, Masataka, Masataka Nakamura
openaire +2 more sources
The intersection of matroids and antimatroids [PDF]
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernhard Korte, László Lovász 0001
openaire +3 more sources
Homomorphisms and Ramsey properties of antimatroids [PDF]
Discrete Applied Mathematics, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernhard Korte, László Lovász 0001
openaire +3 more sources
An axiomatization of the Banzhaf value for cooperative games on antimatroids [PDF]
, 2002 Cooperative games on antimatroids are cooperative games restricted by a combinatorial structure which generalize the permission structure. So, cooperative games on antimatroids group several well-known families of games which have important applications ...
Algaba, E. +2 more
openaire +2 more sources
Antimatroids induced by matchings [PDF]
Discrete Applied Mathematics, 2019 We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings.
Yasushi Kawase, Yutaro Yamaguchi 0001
openaire +4 more sources
Ars Mathematica Contemporanea, 2013 The notion of “antimatroid with repetition” was conceived by Bjorner, Lovasz and Shor in 1991 as an extension of the notion of antimatroid in the framework of non-simple languages. Further they were investigated by the name of “poly-antimatroids” (Nakamura, 2005, Kempner & Levit, 2007), where the set system approach was used. If the underlying set of a
Yulia Kempner, Vadim E. Levit
openaire +6 more sources
On the shelling antimatroids of split graphs [PDF]
Electronic Notes in Discrete Mathematics, 2016 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of these antimatroids, namely the split graph shelling antimatroids.
Cardinal, Jean +2 more
openaire +8 more sources
An algorithmic characterization of antimatroids
Discrete Applied Mathematics, 1990 This paper provides an algorithmic characterization of truncated antimatroids that helps to provide further insight into the structure and algorithmic relevance of antimatroids. The \(1| prec| f_{\max}\) scheduling problem is generalized in a more abstract form to the minmax nesting problem: Given a simple language (E,\({\mathcal L})\) with an f ...
Faigle, U., Boyd, E. Andrew
openaire +3 more sources
Monge sequences, antimatroids, and the transportation problem with forbidden arcs [PDF]
, 1990 This paper considers the transportation problem, both in the standard form and in the case where flow is prohibited on some arcs. We review the celebrated Monge sequence result for the standard problem, give an antimatroid interpretation of an algorithm ...
Dietrich, Brenda L., Brenda L. Dietrich
core +1 more source