Linearity is strictly more powerful than contiguity for encoding graphs

Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan. Linearity is strictly more powerful than contiguity for encoding graphs. Discrete Mathematics, 339(8):2168-2177, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.