L(d, 1)-labelings of the edge-path-replacement of a graph.
Damei LüNianfeng LinPublished in: J. Comb. Optim. (2013)
Keyphrases
- weighted graph
- edge weights
- disjoint paths
- shortest path
- strongly connected
- undirected graph
- graph theory
- directed graph
- graph representation
- solution path
- structured data
- bipartite graph
- graph structure
- spanning tree
- graph model
- edge detection
- path length
- edge map
- random graphs
- graph databases
- edge information
- vertex set
- adjacency graph
- edge detector
- random walk
- hamiltonian path
- graph structures
- neural network
- minimum cost path
- minimum spanning tree
- shortest path problem
- graph theoretic
- graph partitioning
- graph mining
- graph matching
- connected components
- mobile robot
- image processing