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