On Tradeoffs Between Width- and Fill-like Graph Parameters.
Dariusz DereniowskiAdam StanskiPublished in: Theory Comput. Syst. (2019)
Keyphrases
- sensitivity analysis
- graph structure
- random walk
- parameter estimation
- parameter values
- data sets
- maximum likelihood
- expectation maximization
- structured data
- parameter space
- parameter settings
- graph theory
- adjacency matrix
- graph clustering
- parameter selection
- graph theoretic
- graph model
- hidden markov models
- pairwise
- case study