On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
Kei UchizawaTakanori AokiTakehiro ItoAkira SuzukiXiao ZhouPublished in: COCOON (2011)
Keyphrases
- computationally efficient
- computational complexity
- graph theory
- learning algorithm
- orders of magnitude
- computational cost
- polynomial time complexity
- representational power
- high computational complexity
- worst case
- significant improvement
- memory requirements
- optimization problems
- theoretical analysis
- computational problems
- complexity measures
- data mining
- bipartite graph
- data structure
- space complexity
- objective function
- social networks