On the Size of Edge Chromatic Critical Graphs.
Daniel P. SandersYue ZhaoPublished in: J. Comb. Theory, Ser. B (2002)
Keyphrases
- weighted graph
- computational complexity
- undirected graph
- color images
- maximal cliques
- graph matching
- uniform random
- learning algorithm
- minimum spanning trees
- edge detection
- image quality
- directed graph
- multiple scales
- graph theoretic
- graph theory
- maximum clique
- graph partitioning
- graph databases
- edge information
- neural network
- edge detector
- pairwise
- genetic algorithm