Upper bounds on the Steiner diameter of a graph.
Patrick AliPeter DankelmannSimon MukwembiPublished in: Discret. Appl. Math. (2012)
Keyphrases
- upper bound
- lower bound
- average degree
- graph theory
- tight bounds
- upper and lower bounds
- graph model
- worst case
- minimum spanning tree
- constant factor
- lower and upper bounds
- directed acyclic graph
- steiner tree
- sample size
- directed graph
- tight upper and lower bounds
- efficiently computable
- linear programming
- structured data
- random graphs
- graph representation
- branch and bound algorithm
- branch and bound
- graph structure
- sample complexity
- spanning tree
- dependency graph
- random walk
- graph cuts
- graph matching
- generalization error
- weighted graph