抄録
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.
本文言語 | English |
---|---|
ホスト出版物のタイトル | Proceedings - 2018 IEEE 42nd Annual Computer Software and Applications Conference, COMPSAC 2018 |
編集者 | Chung-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 |
出版社 | IEEE Computer Society |
ページ | 817-818 |
ページ数 | 2 |
巻 | 1 |
ISBN(電子版) | 9781538626665 |
DOI | |
出版ステータス | Published - 2018 6 8 |
イベント | 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018 - Tokyo, Japan 継続期間: 2018 7 23 → 2018 7 27 |
Other
Other | 42nd IEEE Computer Software and Applications Conference, COMPSAC 2018 |
---|---|
Country | Japan |
City | Tokyo |
Period | 18/7/23 → 18/7/27 |
ASJC Scopus subject areas
- Software
- Computer Science Applications