Results 71 to 80 of about 114 (83)
Some of the next articles are maybe not open access.
Gray Codes for AT-Free Orders via Antimatroids
2016The \({{\mathrm{\mathrm {AT}}}}\)-free order is a linear order of the vertices of a graph the existence of which characterizes \({{\mathrm{\mathrm {AT}}}}\)-free graphs. We show that all \({{\mathrm{\mathrm {AT}}}}\)-free orders of an \({{\mathrm{\mathrm {AT}}}}\)-free graph can be generated in O(1) amortized time.
Jou-Ming Chang +2 more
openaire +2 more sources
Uniform Antimatroid Closure Spaces
1998Often the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimal generating set (as in convex geometries in which the extreme points of a convex set generate the closed set), we have an antimatroid closure space.
openaire +1 more source
Transformations of Antimatroid Closure Spaces
1998Investigation of the transformations of vector spaces, whose most abstract formulations are called matroids, is basic in mathematics; but transformations of discrete spaces have received relatively little attention. This paper develops the concept of transformations of discrete spaces in the context of antimatroid closure spaces.
openaire +1 more source
Generalized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties
Mathematics of Operations Research, 1992Paul Glasserman, David D Yao
exaly
A Geometric Characterization of Poly-antimatroids
Electronic Notes in Discrete Mathematics, 2007Vadim Levit, Yulia Kempner
exaly
The forbidden minor characterization of line-search antimatroids of rooted digraphs
Discrete Applied Mathematics, 2003Yoshio Okamoto
exaly
Distributive Lattice Polyhedra
Electronic Notes in Discrete Mathematics, 2009Vadim Levit, Yulia Kempner
exaly
Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
Electronic Notes in Discrete Mathematics, 2002exaly