Skip to main content
Research
Discrete Applied Mathematics
Paper

Succinct representation of general unlabeled graphs

View publication

Abstract

We show that general unlabeled graphs on n nodes can be represented by (n2) - n log2 n + O(n) bits which is optimal up to the O(n) term. Both the encoding and decoding require linear time. © 1990.

Related

View all publications