Computing Well-Balanced Spanning Trees of Unweighted Networks
A spanning tree of a network or graph is a subgraph that connects all nodes with the minimum number or total weight of edges. Spanning trees are among the simplest yet most effective techniques for network simplification, sampling, and uncovering a network’s backbone or skeleton. Prim’s algorithm an...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
MDPI AG
2025-11-01
|
| Sarja: | Algorithms |
| Aiheet: | |
| Linkit: | https://www.mdpi.com/1999-4893/18/12/760 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|