The potential of greed for independence (Q4650180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q62043613, #quickstatements; #temporary_batch_1723667127323
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: GreedyMAX-type Algorithms for the Maximum Independent Set Problem / 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: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equality of the partial Grundy and upper ochromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number in terms of the degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Grundy Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic lower bound on the independence number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of arbitrary hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the Grundy chromatic number of graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62043613 / rank
 
Normal rank

Latest revision as of 22:55, 14 August 2024

scientific article; zbMATH DE number 6110306
Language Label Description Also known as
English
The potential of greed for independence
scientific article; zbMATH DE number 6110306

    Statements

    The potential of greed for independence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2012
    0 references
    greedy algorithm
    0 references
    independent set
    0 references
    potential function
    0 references
    Grundy potential
    0 references
    locally treelike graphs
    0 references
    weighting vertices
    0 references

    Identifiers