Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
Panagiotis CheilarisBalázs KeszeghDömötör PálvölgyiPublished in: SOFSEM (2012)
Keyphrases
- conflict free
- graph theory
- functional dependencies
- spanning tree
- maximal cliques
- minimum spanning tree
- tree structure
- graph structure
- tree structured data
- database schemes
- multivalued dependencies
- adjacency matrix
- argumentation frameworks
- directed graph
- object oriented
- undirected graph
- index structure
- dynamic programming
- lower bound
- databases
- database