Graph compression and the zeros of polynomials (Q834888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4471358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of general unlabeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank

Latest revision as of 22:38, 1 July 2024

scientific article
Language Label Description Also known as
English
Graph compression and the zeros of polynomials
scientific article

    Statements

    Graph compression and the zeros of polynomials (English)
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    0 references
    theory of computation
    0 references
    data compression
    0 references
    graphs
    0 references
    0 references