Bijections for the numeric representation of labeled graphs

Victor Parque Tenorio, Masakazu Kobayashi, Masatake Higashi

研究成果: Conference contribution

18 被引用数 (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.

本文言語English
ホスト出版物のタイトルConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
出版社Institute of Electrical and Electronics Engineers Inc.
ページ447-452
ページ数6
2014-January
January
DOI
出版ステータスPublished - 2014
外部発表はい
イベント2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States
継続期間: 2014 10月 52014 10月 8

Other

Other2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014
国/地域United States
CitySan Diego
Period14/10/514/10/8

ASJC Scopus subject areas

  • 電子工学および電気工学
  • 制御およびシステム工学
  • 人間とコンピュータの相互作用

フィンガープリント

「Bijections for the numeric representation of labeled graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル