Exact Algorithm for L(2, 1) Labeling of Cartesian Product Between Complete Bipartite Graph and Path.
Sumonta GhoshAnita PalPublished in: ACSS (1) (2018)
Keyphrases
- data sets
- cartesian product
- bipartite graph
- dynamic programming
- optimal solution
- learning algorithm
- matching algorithm
- worst case
- computational complexity
- active learning
- objective function
- graph model
- path finding
- np hard
- multi agent
- greedy algorithm
- image segmentation
- optimal path
- minimum weight
- search engine
- maximum cardinality