Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.
Binh-Minh Bui-XuanMichel HabibVincent LimouzyFabien de MontgolfierPublished in: WG (2006)
Keyphrases
- data structure
- graph theory
- computational cost
- computationally efficient
- orders of magnitude
- decomposition methods
- learning algorithm
- computational complexity
- directed graph
- decomposition algorithm
- strongly connected
- significant improvement
- optimization problems
- graphical models
- graph partitioning
- partitioning algorithm