On succinct representation of directed graphs

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

    12 Citations (Scopus)

    Abstract

    Directed graphs encode meaningful dependencies among objects ubiquitously. This paper introduces new and simple representations for labeled directed graphs with the properties of being succinct (space is information-theoretically optimal); in which we avoid exploiting a-priori knowledge on digraph regularity such as triangularity, separability, planarity, symmetry and sparsity. Our results have direct implications to model directed graphs by using single integer numbers effectively, which is significant to enable canonical (generation of graph instances is unique) and efficient (coding and decoding take polynomial time) encodings for learning and optimization algorithms. To the best of our knowledge, the proposed representations are the first known in the literature.

    Original languageEnglish
    Title of host publication2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages199-205
    Number of pages7
    ISBN (Electronic)9781509030156
    DOIs
    Publication statusPublished - 2017 Mar 17
    Event2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017 - Jeju Island, Korea, Republic of
    Duration: 2017 Feb 132017 Feb 16

    Other

    Other2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017
    CountryKorea, Republic of
    CityJeju Island
    Period17/2/1317/2/16

    Fingerprint

    Directed graphs
    Decoding
    Polynomials

    ASJC Scopus subject areas

    • Information Systems
    • Artificial Intelligence
    • Computer Science Applications
    • Computer Vision and Pattern Recognition

    Cite this

    Parque Tenorio, V., & Miyashita, T. (2017). On succinct representation of directed graphs. In 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017 (pp. 199-205). [7881738] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BIGCOMP.2017.7881738

    On succinct representation of directed graphs. / Parque Tenorio, Victor; Miyashita, Tomoyuki.

    2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 199-205 7881738.

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

    Parque Tenorio, V & Miyashita, T 2017, On succinct representation of directed graphs. in 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017., 7881738, Institute of Electrical and Electronics Engineers Inc., pp. 199-205, 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017, Jeju Island, Korea, Republic of, 17/2/13. https://doi.org/10.1109/BIGCOMP.2017.7881738
    Parque Tenorio V, Miyashita T. On succinct representation of directed graphs. In 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 199-205. 7881738 https://doi.org/10.1109/BIGCOMP.2017.7881738
    Parque Tenorio, Victor ; Miyashita, Tomoyuki. / On succinct representation of directed graphs. 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 199-205
    @inproceedings{df106dabb40641df904689964b2793c3,
    title = "On succinct representation of directed graphs",
    abstract = "Directed graphs encode meaningful dependencies among objects ubiquitously. This paper introduces new and simple representations for labeled directed graphs with the properties of being succinct (space is information-theoretically optimal); in which we avoid exploiting a-priori knowledge on digraph regularity such as triangularity, separability, planarity, symmetry and sparsity. Our results have direct implications to model directed graphs by using single integer numbers effectively, which is significant to enable canonical (generation of graph instances is unique) and efficient (coding and decoding take polynomial time) encodings for learning and optimization algorithms. To the best of our knowledge, the proposed representations are the first known in the literature.",
    author = "{Parque Tenorio}, Victor and Tomoyuki Miyashita",
    year = "2017",
    month = "3",
    day = "17",
    doi = "10.1109/BIGCOMP.2017.7881738",
    language = "English",
    pages = "199--205",
    booktitle = "2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    TY - GEN

    T1 - On succinct representation of directed graphs

    AU - Parque Tenorio, Victor

    AU - Miyashita, Tomoyuki

    PY - 2017/3/17

    Y1 - 2017/3/17

    N2 - Directed graphs encode meaningful dependencies among objects ubiquitously. This paper introduces new and simple representations for labeled directed graphs with the properties of being succinct (space is information-theoretically optimal); in which we avoid exploiting a-priori knowledge on digraph regularity such as triangularity, separability, planarity, symmetry and sparsity. Our results have direct implications to model directed graphs by using single integer numbers effectively, which is significant to enable canonical (generation of graph instances is unique) and efficient (coding and decoding take polynomial time) encodings for learning and optimization algorithms. To the best of our knowledge, the proposed representations are the first known in the literature.

    AB - Directed graphs encode meaningful dependencies among objects ubiquitously. This paper introduces new and simple representations for labeled directed graphs with the properties of being succinct (space is information-theoretically optimal); in which we avoid exploiting a-priori knowledge on digraph regularity such as triangularity, separability, planarity, symmetry and sparsity. Our results have direct implications to model directed graphs by using single integer numbers effectively, which is significant to enable canonical (generation of graph instances is unique) and efficient (coding and decoding take polynomial time) encodings for learning and optimization algorithms. To the best of our knowledge, the proposed representations are the first known in the literature.

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

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

    U2 - 10.1109/BIGCOMP.2017.7881738

    DO - 10.1109/BIGCOMP.2017.7881738

    M3 - Conference contribution

    SP - 199

    EP - 205

    BT - 2017 IEEE International Conference on Big Data and Smart Computing, BigComp 2017

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -