Succinct Representations of Graphs (Invited Talk)

Author Kunihiko Sadakane



PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2022.1.pdf
  • Filesize: 257 kB
  • 1 pages

Document Identifiers

Author Details

Kunihiko Sadakane
  • Graduate School of Information Science and Technology, The University of Tokyo, Japan

Cite AsGet BibTex

Kunihiko Sadakane. Succinct Representations of Graphs (Invited Talk). In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ISAAC.2022.1

Abstract

We consider the problem of finding succinct representations of graphs, that is, encodings using asymptotically the minimum number of bits which support queries on the graphs efficiently. For a special class of graphs, there exist many theoretical results and practical implementations on ordered trees. On the other hand, for wider classes of graphs, though there are many results on counting the number of non-isomorphic graphs belonging to a graph class, there were few number of results on their succinct representations until recently. In this talk, we review some recent results on succinct representations of graphs such as interval, permutation, circle, circular-arc, trapezoid, circle-trapezoid, k-polygon, circle-polygon, cograph, separable, ptolemaic, distance hereditary, clique width k, block, cactus, series-parallel, planar, tree width k, path, boxicity k, chordal bipartite, strongly chordal, chordal graphs, etc.

Subject Classification

ACM Subject Classification
  • Theory of computation → Data compression
  • Mathematics of computing → Graph enumeration
Keywords
  • Graph Enumeration
  • Succinct Data Structure
  • Compression

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail