Monash University
Browse
tr-2014-277-full.pdf (100.6 kB)

On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs

Download (100.6 kB)
report
posted on 2022-07-25, 00:14 authored by L Allison
This report concerns the information content of a graph, optionally conditional on one or more background, "common knowledge" graphs. It describes an algorithm to estimate this information content, and includes some examples based on chemical compounds.

History

Technical report number

2014/277

Year of publication

2014

Usage metrics

    Monash Information Technology Technical Reports

    Categories

    Keywords

    Graphnetworkcomplexityinformation contentsex drugsrock and roll (not).

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC