Cargando...
Degree sums and dense spanning trees
Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to formulate some general conditions on the sum of...
Guardado en:
| Publicado en: | PLoS One |
|---|---|
| Autores principales: | , , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Public Library of Science
2017
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5605090/ https://ncbi.nlm.nih.gov/pubmed/28926585 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1371/journal.pone.0184912 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|