On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices.
Xueliang LiYaping MaoPublished in: Graphs Comb. (2015)
Keyphrases
- steiner tree
- minimum spanning tree
- graph theory
- undirected graph
- weighted graph
- maximal cliques
- labeled graphs
- shortest path
- random graphs
- edge weights
- spanning tree
- attributed graphs
- facility location
- adjacency matrix
- directed graph
- approximation algorithms
- linear programming relaxation
- bipartite graph
- complex networks
- graph mining
- mixed integer
- social networks
- graph structure
- knapsack problem
- social network analysis
- computational complexity
- optimal solution