Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs.
B. S. Panda PriyamvadaPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- computational complexity
- worst case
- computational cost
- representational power
- high computational complexity
- graph theory
- orders of magnitude
- weighted graph
- polynomial time complexity
- learning algorithm
- space complexity
- decision problems
- graphical models
- optimization problems
- edge detection
- scheduling problem
- significant improvement