Information processing in complex networks: Graph entropy and information functionals (Q945216): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / 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: Structural information content of networks: graph entropy based on local vertex functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cybernetical physics. From control of chaos to quantum control. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / 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: 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: Q3818360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035133 / rank
 
Normal rank

Revision as of 15:59, 28 June 2024

scientific article
Language Label Description Also known as
English
Information processing in complex networks: Graph entropy and information functionals
scientific article

    Statements

    Information processing in complex networks: Graph entropy and information functionals (English)
    0 references
    0 references
    12 September 2008
    0 references
    graphs
    0 references
    structural information content
    0 references
    graph entropy
    0 references
    information theory
    0 references
    applied graph theory
    0 references

    Identifiers