On edge-intersection graphs of k-bend paths in grids.
Therese C. BiedlMichal SternPublished in: Discret. Math. Theor. Comput. Sci. (2010)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- directed graph
- shortest path
- edge detection
- minimum spanning trees
- edge weights
- edge information
- graph structure
- graph mining
- bipartite graph
- edge detector
- random graphs
- graph partitioning
- graph theoretic
- vertex set
- subgraph isomorphism
- hexagonal grid
- multiple scales
- graph databases
- complex structures
- spanning tree
- data sets
- graph model
- graph theory
- graph matching
- web pages