Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
Arman BoyaciTínaz EkimMordechai ShalomShmuel ZaksPublished in: CoRR (2015)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- shortest path
- directed graph
- grid computing
- edge information
- minimum spanning trees
- graph matching
- edge detection
- graph model
- edge detector
- approximation algorithms
- graph partitioning
- graph clustering
- adjacency graph
- computational grids
- random graphs
- social networks
- grid points
- series parallel
- straight line segments
- graph construction
- graph structure
- graph theory