The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.
Jørgen Bang-JensenAnders YeoPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- color images
- algebraic structures
- computational complexity
- worst case
- graph properties
- connected components
- graph theoretic
- maximum clique
- color information
- desirable properties
- structural properties
- polynomial time complexity
- graph mining
- graph theory
- neural network
- graph matching
- directed graph
- search algorithm
- similarity measure