An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.
Feodor F. DraganEkkehard KöhlerPublished in: Algorithmica (2014)
Keyphrases
- undirected graph
- graph structure
- graph isomorphism
- tree structure
- graph theory
- k means
- learning algorithm
- graph clustering
- minimum spanning tree
- dynamic programming
- spanning tree
- detection algorithm
- matching algorithm
- directed graph
- binary tree
- adjacency graph
- expectation maximization
- hyper graph
- computational complexity
- error bounds
- graph matching
- approximation algorithms
- approximation ratio
- graph partitioning
- suffix tree
- objective function
- random graphs
- finding the shortest path
- polynomial time complexity
- graph theoretic
- weighted graph
- segmentation algorithm
- worst case
- probabilistic model
- xml documents
- bayesian networks