Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q4828935): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5494926
 
label / enlabel / en
 
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
description / endescription / en
 
scientific article; zbMATH DE number 6323067
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1295.05089 / rank
 
Normal rank
Property / publication date
 
30 July 2014
Timestamp+2014-07-30T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 30 July 2014 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6323067 / rank
 
Normal rank
Property / title
 
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (English)
Property / title: Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/120879142 / rank
 
Normal rank
Property / published in
 
Property / published in: SIAM Journal on Computing / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graphs
Property / zbMATH Keywords: planar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
data structures
Property / zbMATH Keywords: data structures / rank
 
Normal rank
Property / zbMATH Keywords
 
compression
Property / zbMATH Keywords: compression / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105127893 / rank
 
Normal rank

Latest revision as of 10:20, 6 May 2024

scientific article; zbMATH DE number 6323067
Language Label Description Also known as
English
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
scientific article; zbMATH DE number 6323067

    Statements

    0 references
    0 references
    0 references
    29 November 2004
    0 references
    30 July 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (English)
    0 references
    0 references
    planar graphs
    0 references
    graph algorithms
    0 references
    data structures
    0 references
    compression
    0 references
    0 references