论文信息 - Graph compression and the zeros of polynomials - 字舞流文

Graph compression and the zeros of polynomials

Narsingh Deo | Bruce E. Litow | N. Deo | B. Litow

[1] Moni Naor,et al. Implicit representation of graphs , 1992, STOC '88.

[2] Moni Naor. Succinct representation of general unlabeled graphs , 1990, Discret. Appl. Math..

[3] Maurice Mignotte,et al. Mathematics for computer algebra , 1991 .

[4] Yuri Matiyasevich,et al. Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.

[5] Bud Mishra,et al. Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[6] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[7] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[8] Xin He,et al. A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs , 2000, SIAM J. Comput..

[9] Yi-Ting Chiang,et al. Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[10] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[11] Hsueh-I Lu,et al. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits , 2002, SODA '02.

[12] Guy E. Blelloch,et al. Compact representations of separable graphs , 2003, SODA '03.

[13] Alon Itai,et al. Representation of graphs , 1982, Acta Informatica.