On Graph Representation with Smallest Numerical Encoding

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


The study of succinct representation of graphs has received relevant attention to allow efficiency in modeling interconnected systems. Related work on graph representation has achieved compact encodings by benefiting from structural regularities, such as triangularity, separability, planarity, symmetry and sparsity; whereas the case of arbitrary unstructured graphs has remained elusive. In this paper, we propose an scheme to represent arbitrary graphs by using the smallest integer number. We believe our approach is useful to represent graphs efficiently.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018
EditorsChung-Horng Lung, Thomas Conte, Ling Liu, Toyokazu Akiyama, Kamrul Hasan, Edmundo Tovar, Hiroki Takakura, William Claycomb, Stelvio Cimato, Ji-Jiang Yang, Zhiyong Zhang, Sheikh Iqbal Ahamed, Sorel Reisman, Claudio Demartini, Motonori Nakamura
PublisherIEEE Computer Society
Number of pages2
ISBN (Electronic)9781538626665
Publication statusPublished - 2018 Jun 8
Event42nd IEEE Computer Software and Applications Conference, COMPSAC 2018 - Tokyo, Japan
Duration: 2018 Jul 232018 Jul 27

Publication series

NameProceedings - International Computer Software and Applications Conference
ISSN (Print)0730-3157


Other42nd IEEE Computer Software and Applications Conference, COMPSAC 2018


  • Encoding
  • Enumerative encoding
  • Graph representation
  • Graphs
  • Numerical representation
  • Representation

ASJC Scopus subject areas

  • Software
  • Computer Science Applications


Dive into the research topics of 'On Graph Representation with Smallest Numerical Encoding'. Together they form a unique fingerprint.

Cite this