On a generalization of triangulated graphs for domains decomposition of CSPs.
Assef ChmeissPhilippe JégouLamia KeddarPublished in: IJCAI (2003)
Keyphrases
- tree decomposition
- constraint satisfaction problems
- hypertree decomposition
- graph theory
- reeb graph
- real world
- decomposition methods
- application domains
- structural learning
- constraint propagation
- search space
- constraint graph
- constraint networks
- graph model
- cross domain
- graph mining
- weighted graph
- constraint satisfaction
- graph representation
- non binary
- directed graph
- social networks