Steiner 3-diameter, maximum degree and size of a graph.
Yaping MaoPublished in: Int. J. Comput. Math. Comput. Syst. Theory (2022)
Keyphrases
- maximum number
- minimum spanning tree
- memory requirements
- graph theory
- maximal cliques
- random graphs
- graph model
- graph structure
- computational complexity
- connected components
- structured data
- bipartite graph
- random walk
- stable set
- graph mining
- data structure
- steiner tree
- maximum distance
- average degree
- data sets
- bounded degree
- dependency graph
- directed acyclic graph
- directed graph
- graphical models
- learning algorithm
- neural network