Representing graphs implicitly using almost optimal space (Q5928875)
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 1584472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Representing graphs implicitly using almost optimal space |
scientific article; zbMATH DE number 1584472 |
Statements
Representing graphs implicitly using almost optimal space (English)
0 references
24 August 2002
0 references
The authors present a new graph labelling scheme that assigns to each vertex \(v\) of degree \(\delta(v)\) of a graph of order \(n\) a \(O(\delta(v)\log^2n)\) bit label. The adjacency test can be performed in seven steps and the entire scheme can be computed in polynomial time. In addition, the scheme is implicit (without pointers).
0 references
labelling
0 references
adjacency test
0 references
0 references
0 references
0.8260630965232849
0 references
0.8228721022605896
0 references
0.8115414977073669
0 references
0.8101497888565063
0 references
