Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
Panagiotis CheilarisBalázs KeszeghDömötör PálvölgyiPublished in: SIAM J. Discret. Math. (2013)
Keyphrases
- conflict free
- graph theory
- functional dependencies
- spanning tree
- minimum spanning tree
- database schemes
- tree structure
- tree structured data
- graph structure
- adjacency matrix
- maximal cliques
- graph matching
- case study
- index structure
- reachability queries
- databases
- directed graph
- undirected graph
- graph mining
- np hard
- multivalued dependencies
- relational databases