On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs.
Julien BensmailHervé HocquardDimitri LajouPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- graph matching
- graph theory
- color images
- graph theoretic
- human perception
- search engine
- structured objects
- graph construction
- graph partitioning
- graph databases
- graph mining
- directed graph
- real time
- graph structure
- color information
- knn
- tree structures
- search algorithm
- subgraph isomorphism
- series parallel
- graph isomorphism