Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world graphs is an inaccessible calculation. Recent...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
MDPI AG
2018-06-01
|
| Serier: | Entropy |
| Fag: | |
| Online adgang: | http://www.mdpi.com/1099-4300/20/7/481 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|