On compact encoding of pagenumber k graphs

HIGHLIGHTS

• who: DMTCS, vol. and Cyril, Gavoille from the (UNIVERSITY) have published the article: On Compact Encoding of Pagenumber k Graphs, in the Journal: (JOURNAL)
• what: 2 Lower Bound First, the authors show that Ω(kn) bits are required in general to code a graph of pagenumber k. To recover the embedding from the string S and the bitmap B, the authors determine for each node u the substring Su of S associated with u and computed as follows: find positions p0 and p1 of the u-th and the (u + 1)-th bit 1 in B . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.