Linearity is Strictly More Powerful than Contiguity for Encoding Graphs

Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01242024
Contributor : Christophe Crespelle <>
Submitted on : Friday, December 11, 2015 - 12:33:48 PM
Last modification on : Wednesday, April 3, 2019 - 1:07:54 AM

Identifiers

  • HAL Id : hal-01242024, version 1

Citation

Christophe Crespelle, Tien-Nam Le, Perrot Kevin, Thi Ha Duong Phan. Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. 14th International Symposium on Algorithms and Data Structures – WADS 2015, 2015, Victoria, Canada. pp.212-223. ⟨hal-01242024⟩

Share

Metrics

Record views

222