On s-t paths and trails in edge-colored graphs.
Laurent GourvèsAdria LyraCarlos A. J. MartinhonJérôme MonnotFábio ProttiPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- directed graph
- shortest path
- minimum spanning trees
- edge weights
- graph clustering
- graph partitioning
- path finding
- edge information
- graph matching
- edge detection
- graph theoretic
- graph construction
- vertex set
- graph databases
- social networks
- graph structure
- graph data
- multiple scales
- edge detector
- adjacency graph
- object recognition