Antimatroid

Known as: Shelling sequence 
In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2017
05101519862017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
This paper deals with preference representation and aggregation in the context of multiattribute utility theory. We consider a… (More)
  • figure 2
  • table 1
Is this relevant?
2004
2004
In this paper we develop a discrete, T0 topology in which (1) closed sets play a more prominent role than open sets, (2) atoms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
  • E. Algabaa, J. M. Bilbaoa, R. van den Brinkb
  • 2004
The aim of this paper is to introduce cooperative games with a feasible coalition system which is called antimatroid. These… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2003
2003
The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for… (More)
Is this relevant?
2002
2002
We consider a probabilistic antimatroid A on the ground set E, where each element e ∈ E may succeed with probability pe. We focus… (More)
Is this relevant?
1998
1998
Investigation of the transformations of vector spaces, whose most abstract formulations are called matroids, is basic in… (More)
Is this relevant?
1998
1998
Often the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimal… (More)
  • figure 6
Is this relevant?
1997
1997
We extend Crapo’s β invariant from matroids to greedoids, concentrating especially on antimatroids. Several familiar expansions… (More)
Is this relevant?
1992
1992
A generalized semi-Markou scheme models the structure of a discrete event system, such as a network of queues. By studying… (More)
  • figure 1
  • figure 2
Is this relevant?
1989
1989
A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence system 5… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?