Approximating the minimum independent dominating set in perturbed graphs (Q744108): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guo-Hui Lin / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / 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.1016/j.tcs.2013.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039459495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum maximal independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy coloring is a bad probabilistic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating independent set in perturbed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3004148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination number of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 03:27, 9 July 2024

scientific article
Language Label Description Also known as
English
Approximating the minimum independent dominating set in perturbed graphs
scientific article

    Statements

    Approximating the minimum independent dominating set in perturbed graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    independent set
    0 references
    independent dominating set
    0 references
    dominating set
    0 references
    approximation algorithm
    0 references
    perturbed graph
    0 references
    smooth analysis
    0 references
    0 references