Lanean...
Enumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme
Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of this results to Markov chain Monte Carlo methods that sample or optimize over the space of decomposab...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
2009
|
| Gaiak: | |
| Sarrera elektronikoa: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2680312/ https://ncbi.nlm.nih.gov/pubmed/20161696 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.csda.2008.10.029 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|