L(d, 1)-labelings of the edge-path-replacement by factorization of graphs.
Nathaniel J. KarstJessica OehrleinDenise Sakai TroxellJunjie ZhuPublished in: J. Comb. Optim. (2015)
Keyphrases
- weighted graph
- edge weights
- shortest path
- undirected graph
- strongly connected
- kronecker product
- directed graph
- disjoint paths
- edge information
- edge detection
- graph theoretic
- graph structure
- pairwise
- singular value decomposition
- matrix factorization
- spanning tree
- graph mining
- bipartite graph
- minimum cost
- approximation algorithms
- graph representation
- graph matching
- edge detector
- vertex set
- low rank
- minimum spanning trees
- small world
- graph structures
- replacement policy
- adjacency graph
- graph theory