The Parallel Complexity of Coloring Games (Q2819445): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/978-3-662-53354-3_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2513156480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness in hedonic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition formation games with separable preferences. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of strict P-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Stable Outcomes in Hedonic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-sharing in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Welfare Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game Theoretic Approach for Efficient Graph Coloring / rank
 
Normal rank

Latest revision as of 15:50, 12 July 2024

scientific article
Language Label Description Also known as
English
The Parallel Complexity of Coloring Games
scientific article

    Statements

    The Parallel Complexity of Coloring Games (English)
    0 references
    0 references
    29 September 2016
    0 references
    0 references
    graph games
    0 references
    Nash equilibrium
    0 references
    PTIME-hardness
    0 references
    complexity of computing
    0 references
    0 references