Connected Coloring Completion for General Graphs: Algorithms and Complexity.
Benny ChorMichael R. FellowsMark A. RaganIgor RazgonFrances A. RosamondSagi SnirPublished in: COCOON (2007)
Keyphrases
- computational cost
- worst case
- theoretical analysis
- graph theory
- data structure
- computational complexity
- learning algorithm
- previously studied
- special case
- benchmark datasets
- times faster
- orders of magnitude
- complexity analysis
- space complexity
- memory requirements
- neural network
- significant improvement
- high computational complexity
- bayesian networks
- lower complexity
- computationally hard
- representational power
- graph isomorphism