New Bounds and Constructions for Neighbor-Locating Colorings of Graphs.
Dipayan ChakrabortyFlorent FoucaudSoumen NandiSagnik SenD. K. SuprajaPublished in: CALDAM (2023)
Keyphrases
- lower bound
- upper bound
- upper and lower bounds
- graph theoretic
- worst case
- directed graph
- error bounds
- graph matching
- lower and upper bounds
- graph structure
- neighbor selection
- graph coloring
- complex structures
- graph theory
- neural network
- spanning tree
- data sets
- graph representation
- nearest neighbor
- computational complexity
- average case
- graph clustering
- random graphs
- graph construction
- support vector