Inequalities for entropy-based measures of network information content (Q961624): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2009.12.051 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2009.12.051 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978381807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information processing in complex networks: Graph entropy and information functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information theoretic measures of UHG graphs with low computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: I. An index of the relative complexity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information theoretical analysis of ecological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: III. Graphs with prescribed information content / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and the complexity of graphs: IV. Entropy measures and graphical structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5432687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on entropy measures in information theory / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2009.12.051 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:08, 10 December 2024

scientific article
Language Label Description Also known as
English
Inequalities for entropy-based measures of network information content
scientific article

    Statements

    Inequalities for entropy-based measures of network information content (English)
    0 references
    0 references
    0 references
    31 March 2010
    0 references
    graphs
    0 references
    entropy
    0 references
    structural information content
    0 references
    inequalities
    0 references
    information theory
    0 references

    Identifiers