Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079)
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 6410225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithm for min-ranks of graphs with simple tree structures |
scientific article; zbMATH DE number 6410225 |
Statements
Polynomial time algorithm for min-ranks of graphs with simple tree structures (English)
0 references
2 March 2015
0 references
index coding
0 references
network coding
0 references
min-rank
0 references
tree structure
0 references
dynamic~programming
0 references
polynomial time
0 references
0.7786495089530945
0 references
0.7772101759910583
0 references
0.7729604244232178
0 references
0.7630541920661926
0 references
0.7553769946098328
0 references
