Bijections for the numeric representation of labeled graphs

Victor Parque Tenorio, Masakazu Kobayashi, Masatake Higashi

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

20 Citations (Scopus)


Graphs denote useful dependencies among objects ubiquitously. This paper introduces new and simple bijections to the integer grid to enable the succinct, canonical and efficient representations of labeled graphs; whereas previous work has focused on regularities in structure such as triangularity, separability, planarity, symmetry and sparsity. By succinct we imply that space is information-theoretically optimal, by canonical we imply that generation of instances is unique, and by efficient we imply that coding and decoding take polynomial time. Our results have direct implications to handle labeled graphs by using single numbers efficiently, which is significant to enable the canonical graph encodings in learning and optimization algorithms. Our bijections are the first known in the literature.

Original languageEnglish
Title of host publicationConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States
Duration: 2014 Oct 52014 Oct 8


Other2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014
Country/TerritoryUnited States
CitySan Diego

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction


Dive into the research topics of 'Bijections for the numeric representation of labeled graphs'. Together they form a unique fingerprint.

Cite this