Greedily finding a dense subgraph (Q5054810): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating sparse 2—spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037432 / rank
 
Normal rank

Latest revision as of 02:08, 31 July 2024

scientific article; zbMATH DE number 7631752
Language Label Description Also known as
English
Greedily finding a dense subgraph
scientific article; zbMATH DE number 7631752

    Statements

    Identifiers

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