Maximum Size of a Connected Graph with Given Domination Parameters.
S. ArumugamS. VelammalPublished in: Ars Comb. (1999)
Keyphrases
- connected components
- maximum number
- random walk
- graph theory
- computational complexity
- maximum likelihood
- parameter space
- graph representation
- parameter settings
- memory requirements
- sensitivity analysis
- input parameters
- parameter estimation
- weighted graph
- graph model
- graph theoretic
- bounded treewidth
- population size
- bounded degree
- measured data
- data sets
- spanning tree
- bipartite graph
- parameter values
- directed graph
- input data
- learning algorithm