Complexity and algorithms for injective edge-coloring in graphs.
Florent FoucaudHervé HocquardDimitri LajouPublished in: CoRR (2021)
Keyphrases
- computational complexity
- space complexity
- polynomial time complexity
- computational cost
- worst case
- graph theory
- edge detection
- optimization problems
- learning algorithm
- weighted graph
- theoretical analysis
- memory requirements
- np complete
- high computational complexity
- edge information
- computationally efficient
- graphical models
- significant improvement
- lower bound
- image processing