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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107453037 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.6832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Coding With Side Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations over finite fields and the chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785974 / rank
 
Normal rank

Latest revision as of 19:12, 9 July 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
    0 references
    0 references
    0 references
    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 references
    0 references