An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength.
A. Arul ShantrinalSandi KlavzarT. M. RajalaxmiR. Sundara RajanPublished in: J. Graph Algorithms Appl. (2021)
Keyphrases
- matching algorithm
- learning algorithm
- dynamic programming
- square error
- significant improvement
- detection algorithm
- segmentation algorithm
- objective function
- computational cost
- search space
- graph isomorphism
- spanning tree
- incomplete data
- np hard
- cost function
- computational complexity
- k means
- preprocessing
- expectation maximization
- tree structure
- similarity measure
- convergence rate
- social networks