Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.
R. Sundara RajanThomas KalinowskiSandi KlavzarHamid MokhtarT. M. RajalaxmiPublished in: CoRR (2018)
Keyphrases
- lower bound
- weighted graph
- graph embedding
- upper bound
- undirected graph
- branch and bound
- mathematical morphology
- morphological operators
- np hard
- branch and bound algorithm
- objective function
- spectral embedding
- edge detection
- edge weights
- optimal solution
- edge information
- vector space
- lower and upper bounds
- graph theory
- spanning tree
- morphological filtering
- binary images
- congestion control
- data hiding
- travel time
- graph structure
- graph matching
- worst case
- edge detector
- dimensionality reduction
- directed graph
- graph mining
- semi supervised
- high dimensional
- ip networks
- learning algorithm
- end to end