L(2, 1)-labelings of the edge-path-replacement of a graph.
Damei LüPublished in: J. Comb. Optim. (2013)
Keyphrases
- weighted graph
- edge weights
- disjoint paths
- strongly connected
- shortest path
- undirected graph
- directed graph
- solution path
- random walk
- hamiltonian path
- shortest path problem
- graph structure
- edge detection
- vertex set
- graph theory
- bipartite graph
- graph theoretic
- graph representation
- spanning tree
- multiscale
- edge information
- link analysis
- graph partitioning
- diffusion process
- graph databases
- minimum spanning tree
- graph search
- minimum cost
- graph based algorithm
- graph mining
- approximation algorithms
- graph matching
- finding the shortest path