Kolmogorov complexity and random graphs

DOI10.1016/0020-0190(92)90040-3zbMath0742.68035OpenAlexW2005094077MaRDI QIDQ1186589

Walter W. Kirchherr

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90040-3

zbMATH Keywords

Kolmogorov complexityrandom trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

Kolmogorov complexity arguments in combinatorics ⋮ Induction: From Kolmogorov and Solomonoff to De Finetti and Back to Kolmogorov ⋮ Unnamed Item

Cites Work

• A review of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kolmogorov complexity and random graphs