Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107453037 / rank
 
Normal rank

Revision as of 20:11, 19 March 2024

scientific article
Language Label Description Also known as
English
Polynomial time algorithm for min-ranks of graphs with simple tree structures
scientific article

    Statements

    Polynomial time algorithm for min-ranks of graphs with simple tree structures (English)
    0 references
    0 references
    0 references
    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

    Identifiers