Kolmogorov random graphs and the incompressibility method

H Buhrman, M Li, J Tromp, P Vitányi - SIAM Journal on Computing, 1999 - SIAM
We investigate topological, combinatorial, statistical, and enumeration properties of finite
graphs with high Kolmogorov complexity (almost all graphs) using the novel
incompressibility method. Example results are (i) the mean and variance of the number of
(possibly overlapping) ordered labeled subgraphs of a labeled graph as a function of its
randomness deficiency (how far it falls short of the maximum possible Kolmogorov
complexity) and (ii) a new elementary proof for the number of unlabeled graphs.

[CITATION][C] Kolmogorov random graphs and the incompressibility method

J Tromp, HM Buhrman, M Li, PMB Vitanyi - SIAM Journal on …, 2000 - dare.uva.nl
Kolmogorov random graphs and the incompressibility method … Title Kolmogorov random
graphs and the incompressibility method
Showing the best results for this search. See all results