On counting and approximation variants of the subgraph connecting problem (Q3378301)
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 5016671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On counting and approximation variants of the subgraph connecting problem |
scientific article; zbMATH DE number 5016671 |
Statements
30 March 2006
0 references
0.7423746585845947
0 references
0.739502489566803
0 references
0.7342965602874756
0 references
0.7319930791854858
0 references
