Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).
Arman BoyaciTínaz EkimMordechai ShalomShmuel ZaksPublished in: WG (2013)
Keyphrases
- extended abstract
- minimum spanning trees
- weighted graph
- spanning tree
- undirected graph
- disjoint paths
- graph structure
- minimum spanning tree
- shortest path
- graph representations
- edge weights
- tree structure
- edge detection
- directed graph
- graph theoretic
- tree structured data
- edge information
- graph mining
- graph theory
- minimum cost
- binary tree
- reachability queries
- r tree
- complex networks
- index structure
- object recognition
- graph databases
- bipartite graph
- approximation algorithms
- graph matching
- optimal path
- path length
- maximal cliques
- path planning
- strongly connected
- tree nodes
- structured data
- social networks