Transversal greedoids (Q674616)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversal greedoids |
scientific article |
Statements
Transversal greedoids (English)
0 references
5 March 1997
0 references
A new class of set systems is defined in terms of transversals of sets. Examination of the structure of these systems reveals that they are in fact examples of strong greedoids, namely greedoids which are greedy algorithm compatible, called by the author transversal greedoids. In this paper, such set systems are shown to be characterized by a simple exchange property.
0 references
set systems
0 references
greedy algorithm
0 references
transversal greedoids
0 references
exchange property
0 references
