On the Complexity of Some Enumeration Problems for Matroids (Q5470804)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5029665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Some Enumeration Problems for Matroids |
scientific article; zbMATH DE number 5029665 |
Statements
On the Complexity of Some Enumeration Problems for Matroids (English)
0 references
1 June 2006
0 references
incremental polynomial time
0 references
base
0 references
circuit
0 references
flat
0 references
hyperplane
0 references
hypergraph
0 references
Steiner tree
0 references
multiway cut
0 references
0.92175555
0 references
0.91737384
0 references
0 references
0 references
0 references
0.9115784
0 references
0.90707624
0 references
0.90609264
0 references
