An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.
Feodor F. DraganEkkehard KöhlerPublished in: APPROX-RANDOM (2011)
Keyphrases
- undirected graph
- spanning tree
- graph structure
- tree structure
- minimum spanning tree
- learning algorithm
- dynamic programming
- binary tree
- detection algorithm
- k means
- graph isomorphism
- adjacency graph
- approximation algorithms
- hyper graph
- worst case
- error bounds
- constraint graph
- np hard
- finding the shortest path
- subgraph isomorphism
- bipartite graph
- maximum common subgraph
- graph clustering
- graph model
- complex networks
- matching algorithm
- probabilistic model
- search algorithm
- decision trees