Bijections for the numeric representation of labeled graphs

Victor Parque Tenorio; Masakazu Kobayashi; Masatake Higashi

doi:10.1109/SMC.2014.6973948

Bijections for the numeric representation of labeled graphs

Victor Parque Tenorio, Masakazu Kobayashi, Masatake Higashi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

20 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	447-452
Number of pages	6
Volume	2014-January
Edition	January
DOIs	https://doi.org/10.1109/SMC.2014.6973948
Publication status	Published - 2014
Externally published	Yes
Event	2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States Duration: 2014 Oct 5 → 2014 Oct 8

Other

Other	2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014
Country/Territory	United States
City	San Diego
Period	14/10/5 → 14/10/8

ASJC Scopus subject areas

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

Access to Document

10.1109/SMC.2014.6973948

Cite this

Bijections for the numeric representation of labeled graphs. / Parque Tenorio, Victor; Kobayashi, Masakazu; Higashi, Masatake.

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics. Vol. 2014-January January. ed. Institute of Electrical and Electronics Engineers Inc., 2014. p. 447-452 6973948.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Parque Tenorio, V, Kobayashi, M & Higashi, M 2014, Bijections for the numeric representation of labeled graphs. in Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics. January edn, vol. 2014-January, 6973948, Institute of Electrical and Electronics Engineers Inc., pp. 447-452, 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014, San Diego, United States, 14/10/5. https://doi.org/10.1109/SMC.2014.6973948

@inproceedings{18d62604f2f14e7eb3107a6b0aef8379,

title = "Bijections for the numeric representation of labeled graphs",

abstract = "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.",

author = "{Parque Tenorio}, Victor and Masakazu Kobayashi and Masatake Higashi",

year = "2014",

doi = "10.1109/SMC.2014.6973948",

language = "English",

volume = "2014-January",

pages = "447--452",

booktitle = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

edition = "January",

note = "2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 ; Conference date: 05-10-2014 Through 08-10-2014",

}

TY - GEN

T1 - Bijections for the numeric representation of labeled graphs

AU - Parque Tenorio, Victor

AU - Kobayashi, Masakazu

AU - Higashi, Masatake

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938084162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938084162&partnerID=8YFLogxK

U2 - 10.1109/SMC.2014.6973948

DO - 10.1109/SMC.2014.6973948

M3 - Conference contribution

AN - SCOPUS:84938084162

VL - 2014-January

SP - 447

EP - 452

BT - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014

Y2 - 5 October 2014 through 8 October 2014

ER -

Bijections for the numeric representation of labeled graphs

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this