Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.
R. Sundara RajanThomas KalinowskiSandi KlavzarHamid MokhtarT. M. RajalaxmiPublished in: J. Supercomput. (2021)
Keyphrases
- lower bound
- weighted graph
- upper bound
- undirected graph
- graph embedding
- branch and bound
- binary images
- branch and bound algorithm
- mathematical morphology
- morphological operators
- graph matching
- graph theory
- edge detection
- graph partitioning
- objective function
- edge information
- vector space
- lower and upper bounds
- edge weights
- spectral embedding
- bipartite graph
- graph mining
- worst case
- np hard
- morphological operations
- semi supervised
- congestion control
- graph structure
- spanning tree
- end to end
- shortest path
- watermarking algorithm
- ip networks
- search algorithm
- data structure