Vertex coloring acyclic digraphs and their corresponding hypergraphs.
Geir AgnarssonÁgúst S. EgilssonMagnús M. HalldórssonPublished in: Discret. Appl. Math. (2008)
Keyphrases
- directed graph
- undirected graph
- hypertree decomposition
- join dependencies
- np hard
- random walk
- database schemes
- strongly connected
- equivalence classes
- np complete
- relational databases
- graph theory
- hypergraph model
- functional dependencies
- neural network
- spanning tree
- graph structure
- attributed graphs
- decomposition methods
- data dependencies
- normal form
- evolutionary algorithm
- learning algorithm