Streaming algorithms for independent sets in sparse hypergraphs (Q329293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / 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: 68W27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6642158 / rank
 
Normal rank
Property / zbMATH Keywords
 
streaming algorithms
Property / zbMATH Keywords: streaming algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
independent sets
Property / zbMATH Keywords: independent sets / rank
 
Normal rank
Property / zbMATH Keywords
 
Turan bound
Property / zbMATH Keywords: Turan bound / rank
 
Normal rank
Property / zbMATH Keywords
 
online streaming
Property / zbMATH Keywords: online streaming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0051-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1430039862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification in the Semi-streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming graph computations with a helpful advisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Constrained Interval Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Streaming Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Distances in the Data-Stream Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming and Communication Complexity of Clique Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Large Independent Sets in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:31, 12 July 2024

scientific article
Language Label Description Also known as
English
Streaming algorithms for independent sets in sparse hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references