scientific article; zbMATH DE number 1071771

zbMATH Open0882.94011MaRDI QIDQ4359086FDOQ4359086

Authors: Masatoshi Fujii, Masahiro Nakamura, Yuki Seo, Yasuo Watatani 

Publication date: 24 February 1998

Title of this publication is not available (Why is that?)

Recommendations

• Kolmogorov's complexity for positive definite matrices
• Kolmogorov Random Graphs and the Incompressibility Method
• Entropy and the complexity of graphs revisited
• Kolmogorov complexity and random graphs

zbMATH Keywords

entropyKolmogorov complexityadjacency operatorfinite directed graphSchwarz constants

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Measures of information, entropy (94A17)

Cited In (4)

• Kolmogorov's complexity for positive definite matrices
• The complexity of finite graphs
• MAX-plus objects to study the complexity of graphs
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359086)