z-logo
open-access-imgOpen Access
Using Kolmogorov Complexity with Graph and Vertex Entropy to Measure Similarity of Empirical Graphs with Theoretical Graph Models
Author(s) -
Mikołaj Morzy,
Tomasz Kajdanowicz
Publication year - 2015
Language(s) - English
Resource type - Conference proceedings
DOI - 10.3390/ecea-2-c003
Subject(s) - centrality , adjacency matrix , betweenness centrality , katz centrality , mathematics , graph property , random graph , critical graph , comparability graph , butterfly graph , null graph , regular graph , clustering coefficient , discrete mathematics , combinatorics , voltage graph , line graph , graph , statistics , cluster analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom