The Parallel Complexity of Coloring Games
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 139777
- ON THE COMPLEXITY OF SOME COLORING GAMES
- The complexity of coloring games on perfect graphs
- The complexity of two colouring games
- The complexity of grid coloring
- Coloring planar graphs in parallel
- Colouring, constraint satisfaction, and complexity
- scientific article; zbMATH DE number 17674
- The complexity of nonrepetitive coloring
Cites work
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- A Game Theoretic Approach for Efficient Graph Coloring
- A theory of strict P-completeness
- Coalition formation games with separable preferences.
- Computing Stable Outcomes in Hedonic Games
- Distributed welfare games
- Graph theory
- Information-sharing in social networks
- NP-completeness in hedonic games
- Sharing the cost of multicast transmissions
Cited in
(5)- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- A New Pebble Game that Characterizes Parallel Complexity Classes
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Non-existence of stable social groups in information-driven networks
- How long does it take for all users in a social network to choose their communities?
This page was built for publication: The Parallel Complexity of Coloring Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819445)
