A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2017

AUTHORS

Arnaud Casteigts , Ralf Klasing , Yessin M. Neggaz , Joseph G. Peters

ABSTRACT

We presented in [12] an algorithm for computing a parameter called T-interval connectivity of dynamic graphs which are given as a sequence of static graphs. This algorithm operates at a high level, manipulating the graphs in the sequence as atomic elements with two types of operations: a composition operation and a test operation. The algorithm is optimal in the sense that it uses only \(O(\delta )\) composition and test operations, where \(\delta \) is the length of the sequence. In this paper, we generalize this framework to use various composition and test operations, which allows us to compute other parameters using the same high-level strategy that we used for T-interval connectivity. We illustrate the framework through the study of three minimization problems which refer to various properties of dynamic graphs, namely Bounded-Realization-of-the-Footprint, Temporal-Connectivity, and Round-Trip-Temporal-Diameter. More... »

PAGES

321-338

References to SciGraph publications

  • 2015. Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard in ALGORITHMS FOR SENSOR SYSTEMS
  • 2010. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2014. DMVP: Foremost Waypoint Coverage of Time-Varying Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2015. Efficiently Testing $$T$$ -Interval Connectivity in Dynamic Graphs in ALGORITHMS AND COMPLEXITY
  • 2015. Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2016. Self-stabilizing Robots in Highly Dynamic Environments in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • Book

    TITLE

    Structural Information and Communication Complexity

    ISBN

    978-3-319-72049-4
    978-3-319-72050-0

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-319-72050-0_19

    DOI

    http://dx.doi.org/10.1007/978-3-319-72050-0_19

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1100108568


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "name": [
                "LaBRI, CNRS, University of Bordeaux"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Casteigts", 
            "givenName": "Arnaud", 
            "id": "sg:person.014046062661.61", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014046062661.61"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "LaBRI, CNRS, University of Bordeaux"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Klasing", 
            "givenName": "Ralf", 
            "id": "sg:person.016012765273.46", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016012765273.46"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Toulouse", 
              "id": "https://www.grid.ac/institutes/grid.11417.32", 
              "name": [
                "University of Toulouse"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Neggaz", 
            "givenName": "Yessin M.", 
            "id": "sg:person.012743642445.24", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012743642445.24"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Simon Fraser University", 
              "id": "https://www.grid.ac/institutes/grid.61971.38", 
              "name": [
                "Simon Fraser University"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Peters", 
            "givenName": "Joseph G.", 
            "id": "sg:person.015627506034.65", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015627506034.65"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1080/17445760.2012.668546", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005693413"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0377-2217(89)90126-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006090103"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0377-2217(89)90126-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006090103"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-46018-4_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011019112", 
              "https://doi.org/10.1007/978-3-662-46018-4_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2012.10.029", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012732800"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2015.09.030", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1017583432"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/800222.806754", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018316918"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-11476-2_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021306868", 
              "https://doi.org/10.1007/978-3-642-11476-2_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-11476-2_11", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021306868", 
              "https://doi.org/10.1007/978-3-642-11476-2_11"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-18173-8_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027662009", 
              "https://doi.org/10.1007/978-3-319-18173-8_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-21741-3_4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036207392", 
              "https://doi.org/10.1007/978-3-319-21741-3_4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1015467.1015484", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042134783"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.ic.2016.12.004", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043477245"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/2348543.2348589", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045787074"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1806689.1806760", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046808496"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-49259-9_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048432832", 
              "https://doi.org/10.1007/978-3-319-49259-9_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.15803/ijnc.6.1_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048588304"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-12340-0_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051869454", 
              "https://doi.org/10.1007/978-3-319-12340-0_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tc.2012.208", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061535334"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1142/s0129054103001728", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062896465"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1142/s0129054115500288", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062897477"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1030194.1015484", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1063149264"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/aina.2014.115", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095529953"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2017", 
        "datePublishedReg": "2017-01-01", 
        "description": "We presented in [12] an algorithm for computing a parameter called T-interval connectivity of dynamic graphs which are given as a sequence of static graphs. This algorithm operates at a high level, manipulating the graphs in the sequence as atomic elements with two types of operations: a composition operation and a test operation. The algorithm is optimal in the sense that it uses only \\(O(\\delta )\\) composition and test operations, where \\(\\delta \\) is the length of the sequence. In this paper, we generalize this framework to use various composition and test operations, which allows us to compute other parameters using the same high-level strategy that we used for T-interval connectivity. We illustrate the framework through the study of three minimization problems which refer to various properties of dynamic graphs, namely Bounded-Realization-of-the-Footprint, Temporal-Connectivity, and Round-Trip-Temporal-Diameter.", 
        "editor": [
          {
            "familyName": "Das", 
            "givenName": "Shantanu", 
            "type": "Person"
          }, 
          {
            "familyName": "Tixeuil", 
            "givenName": "Sebastien", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-319-72050-0_19", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-319-72049-4", 
            "978-3-319-72050-0"
          ], 
          "name": "Structural Information and Communication Complexity", 
          "type": "Book"
        }, 
        "name": "A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs", 
        "pagination": "321-338", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-319-72050-0_19"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "0d8ffb221de71352ae3c7337591336fe67612c224910f45935468246ce1f9554"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1100108568"
            ]
          }
        ], 
        "publisher": {
          "location": "Cham", 
          "name": "Springer International Publishing", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-319-72050-0_19", 
          "https://app.dimensions.ai/details/publication/pub.1100108568"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T11:14", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8659_00000603.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/978-3-319-72050-0_19"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-72050-0_19'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-72050-0_19'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-72050-0_19'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-72050-0_19'


     

    This table displays all metadata directly associated to this object as RDF triples.

    167 TRIPLES      23 PREDICATES      48 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-319-72050-0_19 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nead14ce3c74c4c2d876e5af0c5f788f1
    4 schema:citation sg:pub.10.1007/978-3-319-12340-0_3
    5 sg:pub.10.1007/978-3-319-18173-8_6
    6 sg:pub.10.1007/978-3-319-21741-3_4
    7 sg:pub.10.1007/978-3-319-49259-9_5
    8 sg:pub.10.1007/978-3-642-11476-2_11
    9 sg:pub.10.1007/978-3-662-46018-4_6
    10 https://doi.org/10.1016/0377-2217(89)90126-4
    11 https://doi.org/10.1016/j.ic.2016.12.004
    12 https://doi.org/10.1016/j.tcs.2012.10.029
    13 https://doi.org/10.1016/j.tcs.2015.09.030
    14 https://doi.org/10.1080/17445760.2012.668546
    15 https://doi.org/10.1109/aina.2014.115
    16 https://doi.org/10.1109/tc.2012.208
    17 https://doi.org/10.1142/s0129054103001728
    18 https://doi.org/10.1142/s0129054115500288
    19 https://doi.org/10.1145/1015467.1015484
    20 https://doi.org/10.1145/1030194.1015484
    21 https://doi.org/10.1145/1806689.1806760
    22 https://doi.org/10.1145/2348543.2348589
    23 https://doi.org/10.1145/800222.806754
    24 https://doi.org/10.15803/ijnc.6.1_27
    25 schema:datePublished 2017
    26 schema:datePublishedReg 2017-01-01
    27 schema:description We presented in [12] an algorithm for computing a parameter called T-interval connectivity of dynamic graphs which are given as a sequence of static graphs. This algorithm operates at a high level, manipulating the graphs in the sequence as atomic elements with two types of operations: a composition operation and a test operation. The algorithm is optimal in the sense that it uses only \(O(\delta )\) composition and test operations, where \(\delta \) is the length of the sequence. In this paper, we generalize this framework to use various composition and test operations, which allows us to compute other parameters using the same high-level strategy that we used for T-interval connectivity. We illustrate the framework through the study of three minimization problems which refer to various properties of dynamic graphs, namely Bounded-Realization-of-the-Footprint, Temporal-Connectivity, and Round-Trip-Temporal-Diameter.
    28 schema:editor N80f7f78a69894b8c8a05e0da223974f8
    29 schema:genre chapter
    30 schema:inLanguage en
    31 schema:isAccessibleForFree false
    32 schema:isPartOf N79a950b56425462bab1a66d6fa552c08
    33 schema:name A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs
    34 schema:pagination 321-338
    35 schema:productId N77821f73a9f3405e8b41f4cec4a581e1
    36 Nbb9bd1a16c42428698ab40663b9848ab
    37 Nfdf08a89e3404774aa5069613a9568f5
    38 schema:publisher N8e22a2d3d59345e89423dca77f0e93db
    39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1100108568
    40 https://doi.org/10.1007/978-3-319-72050-0_19
    41 schema:sdDatePublished 2019-04-15T11:14
    42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    43 schema:sdPublisher N58ce2f1316a24c1d83643dc9e87a8ba6
    44 schema:url http://link.springer.com/10.1007/978-3-319-72050-0_19
    45 sgo:license sg:explorer/license/
    46 sgo:sdDataset chapters
    47 rdf:type schema:Chapter
    48 N08e1505d400d4effa5000821b5e830ce rdf:first N3a6c090945624a6587b140a129fbfad8
    49 rdf:rest rdf:nil
    50 N329448ab316d4328be5266eebcc4af9a rdf:first sg:person.016012765273.46
    51 rdf:rest Nbc9277fdc3464931b666f8b09ae8ab56
    52 N3a6c090945624a6587b140a129fbfad8 schema:familyName Tixeuil
    53 schema:givenName Sebastien
    54 rdf:type schema:Person
    55 N58ce2f1316a24c1d83643dc9e87a8ba6 schema:name Springer Nature - SN SciGraph project
    56 rdf:type schema:Organization
    57 N77821f73a9f3405e8b41f4cec4a581e1 schema:name doi
    58 schema:value 10.1007/978-3-319-72050-0_19
    59 rdf:type schema:PropertyValue
    60 N79a950b56425462bab1a66d6fa552c08 schema:isbn 978-3-319-72049-4
    61 978-3-319-72050-0
    62 schema:name Structural Information and Communication Complexity
    63 rdf:type schema:Book
    64 N80f7f78a69894b8c8a05e0da223974f8 rdf:first N96c9f46bfaa74d4db1b37a36652385d4
    65 rdf:rest N08e1505d400d4effa5000821b5e830ce
    66 N8e22a2d3d59345e89423dca77f0e93db schema:location Cham
    67 schema:name Springer International Publishing
    68 rdf:type schema:Organisation
    69 N96c9f46bfaa74d4db1b37a36652385d4 schema:familyName Das
    70 schema:givenName Shantanu
    71 rdf:type schema:Person
    72 N9e5f5705ab4a49b7950fcebe591d711e rdf:first sg:person.015627506034.65
    73 rdf:rest rdf:nil
    74 Nbb9bd1a16c42428698ab40663b9848ab schema:name dimensions_id
    75 schema:value pub.1100108568
    76 rdf:type schema:PropertyValue
    77 Nbc9277fdc3464931b666f8b09ae8ab56 rdf:first sg:person.012743642445.24
    78 rdf:rest N9e5f5705ab4a49b7950fcebe591d711e
    79 Ncae50055fb954b4c8cf7a8d9ecc349e9 schema:name LaBRI, CNRS, University of Bordeaux
    80 rdf:type schema:Organization
    81 Nead14ce3c74c4c2d876e5af0c5f788f1 rdf:first sg:person.014046062661.61
    82 rdf:rest N329448ab316d4328be5266eebcc4af9a
    83 Nedcd65ef2cea4a08a4d9ea22f9f816d2 schema:name LaBRI, CNRS, University of Bordeaux
    84 rdf:type schema:Organization
    85 Nfdf08a89e3404774aa5069613a9568f5 schema:name readcube_id
    86 schema:value 0d8ffb221de71352ae3c7337591336fe67612c224910f45935468246ce1f9554
    87 rdf:type schema:PropertyValue
    88 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    89 schema:name Information and Computing Sciences
    90 rdf:type schema:DefinedTerm
    91 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    92 schema:name Computation Theory and Mathematics
    93 rdf:type schema:DefinedTerm
    94 sg:person.012743642445.24 schema:affiliation https://www.grid.ac/institutes/grid.11417.32
    95 schema:familyName Neggaz
    96 schema:givenName Yessin M.
    97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012743642445.24
    98 rdf:type schema:Person
    99 sg:person.014046062661.61 schema:affiliation Nedcd65ef2cea4a08a4d9ea22f9f816d2
    100 schema:familyName Casteigts
    101 schema:givenName Arnaud
    102 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014046062661.61
    103 rdf:type schema:Person
    104 sg:person.015627506034.65 schema:affiliation https://www.grid.ac/institutes/grid.61971.38
    105 schema:familyName Peters
    106 schema:givenName Joseph G.
    107 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015627506034.65
    108 rdf:type schema:Person
    109 sg:person.016012765273.46 schema:affiliation Ncae50055fb954b4c8cf7a8d9ecc349e9
    110 schema:familyName Klasing
    111 schema:givenName Ralf
    112 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016012765273.46
    113 rdf:type schema:Person
    114 sg:pub.10.1007/978-3-319-12340-0_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051869454
    115 https://doi.org/10.1007/978-3-319-12340-0_3
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1007/978-3-319-18173-8_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027662009
    118 https://doi.org/10.1007/978-3-319-18173-8_6
    119 rdf:type schema:CreativeWork
    120 sg:pub.10.1007/978-3-319-21741-3_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036207392
    121 https://doi.org/10.1007/978-3-319-21741-3_4
    122 rdf:type schema:CreativeWork
    123 sg:pub.10.1007/978-3-319-49259-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048432832
    124 https://doi.org/10.1007/978-3-319-49259-9_5
    125 rdf:type schema:CreativeWork
    126 sg:pub.10.1007/978-3-642-11476-2_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021306868
    127 https://doi.org/10.1007/978-3-642-11476-2_11
    128 rdf:type schema:CreativeWork
    129 sg:pub.10.1007/978-3-662-46018-4_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011019112
    130 https://doi.org/10.1007/978-3-662-46018-4_6
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1016/0377-2217(89)90126-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006090103
    133 rdf:type schema:CreativeWork
    134 https://doi.org/10.1016/j.ic.2016.12.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043477245
    135 rdf:type schema:CreativeWork
    136 https://doi.org/10.1016/j.tcs.2012.10.029 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012732800
    137 rdf:type schema:CreativeWork
    138 https://doi.org/10.1016/j.tcs.2015.09.030 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017583432
    139 rdf:type schema:CreativeWork
    140 https://doi.org/10.1080/17445760.2012.668546 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005693413
    141 rdf:type schema:CreativeWork
    142 https://doi.org/10.1109/aina.2014.115 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095529953
    143 rdf:type schema:CreativeWork
    144 https://doi.org/10.1109/tc.2012.208 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061535334
    145 rdf:type schema:CreativeWork
    146 https://doi.org/10.1142/s0129054103001728 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062896465
    147 rdf:type schema:CreativeWork
    148 https://doi.org/10.1142/s0129054115500288 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062897477
    149 rdf:type schema:CreativeWork
    150 https://doi.org/10.1145/1015467.1015484 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042134783
    151 rdf:type schema:CreativeWork
    152 https://doi.org/10.1145/1030194.1015484 schema:sameAs https://app.dimensions.ai/details/publication/pub.1063149264
    153 rdf:type schema:CreativeWork
    154 https://doi.org/10.1145/1806689.1806760 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046808496
    155 rdf:type schema:CreativeWork
    156 https://doi.org/10.1145/2348543.2348589 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045787074
    157 rdf:type schema:CreativeWork
    158 https://doi.org/10.1145/800222.806754 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018316918
    159 rdf:type schema:CreativeWork
    160 https://doi.org/10.15803/ijnc.6.1_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048588304
    161 rdf:type schema:CreativeWork
    162 https://www.grid.ac/institutes/grid.11417.32 schema:alternateName University of Toulouse
    163 schema:name University of Toulouse
    164 rdf:type schema:Organization
    165 https://www.grid.ac/institutes/grid.61971.38 schema:alternateName Simon Fraser University
    166 schema:name Simon Fraser University
    167 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...