Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Arman BoyaciTínaz EkimMordechai ShalomShmuel ZaksPublished in: CoRR (2013)
Keyphrases
- minimum spanning trees
- weighted graph
- disjoint paths
- undirected graph
- spanning tree
- minimum spanning tree
- graph structure
- shortest path
- tree structure
- graph matching
- graph representations
- directed graph
- edge weights
- tree structured data
- reachability queries
- maximum weight
- graph theoretic
- graph representation
- edge information
- graph partitioning
- optimal path
- tree structures
- index structure
- maximal cliques
- graph theory
- strongly connected
- subgraph isomorphism
- data structure
- hierarchical structure
- constraint graph
- r tree
- tree nodes
- edge detector
- topological features
- symbolic representation
- data representations
- binary tree
- graph model
- leaf nodes