ロード中...

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...

詳細記述

保存先:
書誌詳細
出版年:Entropy (Basel)
主要な著者: Tee, Philip, Parisis, George, Berthouze, Luc, Wakeman, Ian
フォーマット: Artigo
言語:Inglês
出版事項: MDPI 2018
主題:
オンライン・アクセス:https://ncbi.nlm.nih.gov/pmc/articles/PMC7512999/
https://ncbi.nlm.nih.gov/pubmed/33265571
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e20070481
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!