A note on the Steiner -diameter of a graph.
Yaping MaoChristopher MelekianEddie ChengPublished in: Int. J. Comput. Math. Comput. Syst. Theory (2018)
Keyphrases
- steiner tree
- graph representation
- bipartite graph
- random walk
- graph structure
- minimum spanning tree
- graph model
- average degree
- graph theoretic
- spanning tree
- graph theory
- directed graph
- connected components
- weighted graph
- graph databases
- undirected graph
- special case
- phase transition
- graph matching
- graph search
- graph grammars
- vertex set
- probabilistic model