Succinct representation of general unlabeled graphs (Q2277480)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4195997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Succinct representation of general unlabeled graphs |
scientific article; zbMATH DE number 4195997 |
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
0.8850398659706116
0 references
0.820239245891571
0 references
0.8157632350921631
0 references
0.7962668538093567
0 references
0.7960851788520813
0 references
