ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037)
From MaRDI portal
!
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 5269116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) |
scientific article; zbMATH DE number 5269116 |
Statements
ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (English)
0 references
29 April 2008
0 references
algorithm
0 references
matroid
0 references
enumeration
0 references
quasi-polynomial
0 references
0.9975685477256776
0 references
0.8376578688621521
0 references
0.8048393130302429
0 references
0.7987887263298035
0 references
0.7867622375488281
0 references
