Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs |
scientific article |
Statements
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (English)
0 references
30 October 2015
0 references
0 references
