Complexity and algorithms for injective edge-coloring in graphs.
Florent FoucaudHervé HocquardDimitri LajouPublished in: Inf. Process. Lett. (2021)
Keyphrases
- computational cost
- worst case
- computational complexity
- significant improvement
- graph theory
- data structure
- polynomial time complexity
- representational power
- high computational complexity
- complexity analysis
- weighted graph
- edge detection
- learning algorithm
- memory requirements
- directed graph
- shortest path
- space complexity
- computationally efficient
- np complete