Linearity is Strictly More Powerful than Contiguity for Encoding Graphs

Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01424428
Contributor : Christophe Crespelle <>
Submitted on : Monday, January 2, 2017 - 12:10:06 PM
Last modification on : Tuesday, September 24, 2019 - 11:34:23 AM

Identifiers

  • HAL Id : hal-01424428, version 1

Citation

Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan. Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2168-2177. ⟨hal-01424428⟩

Share

Metrics

Record views

328