Hardness results for three kinds of colored connections of graphs.
Zhong HuangXueliang LiPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- graph matching
- phase transition
- structured objects
- np complete
- np hard
- graph isomorphism
- graph representation
- graph partitioning
- labeled graphs
- graph theory
- graph databases
- graph model
- data sets
- neural network
- graph construction
- graph kernels
- graph theoretic
- learning algorithm
- knowledge base
- upper bound
- weighted graph
- graph structure
- pattern recognition
- computational complexity
- information theoretic
- pairwise
- worst case