Linearity is Strictly More Powerful than Contiguity for Encoding Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015
No file

Dates and versions

hal-01242024 , version 1 (11-12-2015)

Identifiers

  • HAL Id : hal-01242024 , version 1

Cite

Christophe Crespelle, Tien-Nam Le, Kévin Perrot, 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⟩
109 View
0 Download

Share

Gmail Facebook X LinkedIn More