Cyril Gavoille ; Nicolas Hanusse - On Compact Encoding of Pagenumber $k$ Graphs

dmtcs:436 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, Vol. 10 no. 3 -
On Compact Encoding of Pagenumber $k$ GraphsArticle

Authors: Cyril Gavoille ORCID1,2; Nicolas Hanusse 1,2

  • 1 Laboratoire Bordelais de Recherche en Informatique
  • 2 Algorithmics for computationally intensive applications over wide scale distributed platforms

In this paper we show an information-theoretic lower bound of kn - o(kn) on the minimum number of bits to represent an unlabeled simple connected n-node graph of pagenumber k. This has to be compared with the efficient encoding scheme of Munro and Raman of 2kn + 2m + o(kn+m) bits (m the number of edges), that is 4kn + 2n + o(kn) bits in the worst-case. For m-edge graphs of pagenumber k (with multi-edges and loops), we propose a 2mlog2k + O(m) bits encoding improving the best previous upper bound of Munro and Raman whenever m ≤ 1 / 2kn/log2 k. Actually our scheme applies to k-page embedding containing multi-edge and loops. Moreover, with an auxiliary table of o(m log k) bits, our coding supports (1) the computation of the degree of a node in constant time, (2) adjacency queries with O(logk) queries of type rank, select and match, that is in O(logk *minlogk / loglogm, loglogk) time and (3) the access to δ neighbors in O(δ) runs of select, rank or match;.

Volume: Vol. 10 no. 3
Published on: January 1, 2008
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

5 Documents citing this article

Consultation statistics

This page has been seen 316 times.
This article's PDF has been downloaded 226 times.