Succinct representation of general unlabeled graphs (Q2277480): Difference between revisions

What is the shortest possible binary encoding of a simple graph on n vertices if the ordering of the vertices is irrelevant (unlabeled)? In this paper a technique is indicated in order to achieve the theoretical lower bound of \(\left( \begin{matrix} n\\ 2\end{matrix} \right)-n \log_ 2n+O(n)\) in linear time.