Exact algorithms for Kayles (Q476858): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59567437 / 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.2014.09.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970560697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kayles and Nimbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Kayles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compound Node-Kayles on paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank

Latest revision as of 09:52, 9 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for Kayles
scientific article

    Statements

    Exact algorithms for Kayles (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    exact algorithms
    0 references
    combinatorial games
    0 references
    analysis of algorithms
    0 references
    moderately exponential time algorithms
    0 references
    independent sets
    0 references
    0 references
    0 references