Succinct representation of general unlabeled graphs (Q2277480): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Succinct representation of general unlabeled graphs |
scientific article |
Statements
Succinct representation of general unlabeled graphs (English)
0 references
1990
0 references
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.
0 references
binary encoding
0 references
