Computing Parameters of Sequence-Based Dynamic Graphs View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2019-04

AUTHORS

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

ABSTRACT

We present a general framework for computing parameters of dynamic networks which are modelled as a sequence G=(G1,G2,…,Gδ) of static graphs such that Gi=(V,Ei) represents the network topology at time i and changes between consecutive static graphs are arbitrary. The framework 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 framework allows us to compute different parameters of dynamic graphs using a common high-level strategy by using composition and test operations that are specific to the parameter. The resulting algorithms are optimal in the sense that they use only O(δ) composition and test operations, where δ is the length of the sequence. We illustrate our framework with three minimization problems, bounded realization of the footprint, temporal diameter, and round trip temporal diameter, and with T-interval connectivity which is a maximization problem. We prove that the problems are in NC by presenting polylogarithmic-time parallel versions of the algorithms. Finally, we show that the algorithms can operate online with amortized complexity Θ(1) composition and test operations for each graph in the sequence. More... »

PAGES

1-24

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
  • 2017. A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs in STRUCTURAL INFORMATION AND COMMUNICATION 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
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00224-018-9876-z

    DOI

    http://dx.doi.org/10.1007/s00224-018-9876-z

    DIMENSIONS

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


    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, Talence, France"
              ], 
              "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, Talence, France"
              ], 
              "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": "Laboratory for Analysis and Architecture of Systems", 
              "id": "https://www.grid.ac/institutes/grid.462430.7", 
              "name": [
                "LAAS-CNRS, INSA-Toulouse, Toulouse, France"
              ], 
              "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": [
                "School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"
              ], 
              "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.1016/j.tcs.2013.12.024", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002304973"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/17445760.2012.668546", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005693413"
            ], 
            "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.1137/0201010", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062841173"
            ], 
            "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/ipdps.2006.1639347", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094792169"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/aina.2014.115", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095529953"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-72050-0_19", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1100108568", 
              "https://doi.org/10.1007/978-3-319-72050-0_19"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2019-04", 
        "datePublishedReg": "2019-04-01", 
        "description": "We present a general framework for computing parameters of dynamic networks which are modelled as a sequence G=(G1,G2,\u2026,G\u03b4) of static graphs such that Gi=(V,Ei) represents the network topology at time i and changes between consecutive static graphs are arbitrary. The framework 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 framework allows us to compute different parameters of dynamic graphs using a common high-level strategy by using composition and test operations that are specific to the parameter. The resulting algorithms are optimal in the sense that they use only O(\u03b4) composition and test operations, where \u03b4 is the length of the sequence. We illustrate our framework with three minimization problems, bounded realization of the footprint, temporal diameter, and round trip temporal diameter, and with T-interval connectivity which is a maximization problem. We prove that the problems are in NC by presenting polylogarithmic-time parallel versions of the algorithms. Finally, we show that the algorithms can operate online with amortized complexity \u0398(1) composition and test operations for each graph in the sequence.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s00224-018-9876-z", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1052098", 
            "issn": [
              "1432-4350", 
              "1433-0490"
            ], 
            "name": "Theory of Computing Systems", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "63"
          }
        ], 
        "name": "Computing Parameters of Sequence-Based Dynamic Graphs", 
        "pagination": "1-24", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "28234e460ddf38457e94950bb633fc4adcab81af1e3391094d8a5e6180b5b6f4"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00224-018-9876-z"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1105601643"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00224-018-9876-z", 
          "https://app.dimensions.ai/details/publication/pub.1105601643"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T14:03", 
        "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/0000000371_0000000371/records_130831_00000006.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://link.springer.com/10.1007%2Fs00224-018-9876-z"
      }
    ]
     

    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/s00224-018-9876-z'

    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/s00224-018-9876-z'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00224-018-9876-z'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00224-018-9876-z'


     

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

    168 TRIPLES      21 PREDICATES      51 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00224-018-9876-z schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nd13f251be7484e70a8c5bff2e059c4b4
    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-319-72050-0_19
    9 sg:pub.10.1007/978-3-642-11476-2_11
    10 sg:pub.10.1007/978-3-662-46018-4_6
    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.2013.12.024
    14 https://doi.org/10.1016/j.tcs.2015.09.030
    15 https://doi.org/10.1080/17445760.2012.668546
    16 https://doi.org/10.1109/aina.2014.115
    17 https://doi.org/10.1109/ipdps.2006.1639347
    18 https://doi.org/10.1109/tc.2012.208
    19 https://doi.org/10.1137/0201010
    20 https://doi.org/10.1142/s0129054103001728
    21 https://doi.org/10.1142/s0129054115500288
    22 https://doi.org/10.1145/1015467.1015484
    23 https://doi.org/10.1145/1030194.1015484
    24 https://doi.org/10.1145/1806689.1806760
    25 https://doi.org/10.1145/2348543.2348589
    26 https://doi.org/10.1145/800222.806754
    27 https://doi.org/10.15803/ijnc.6.1_27
    28 schema:datePublished 2019-04
    29 schema:datePublishedReg 2019-04-01
    30 schema:description We present a general framework for computing parameters of dynamic networks which are modelled as a sequence G=(G1,G2,…,Gδ) of static graphs such that Gi=(V,Ei) represents the network topology at time i and changes between consecutive static graphs are arbitrary. The framework 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 framework allows us to compute different parameters of dynamic graphs using a common high-level strategy by using composition and test operations that are specific to the parameter. The resulting algorithms are optimal in the sense that they use only O(δ) composition and test operations, where δ is the length of the sequence. We illustrate our framework with three minimization problems, bounded realization of the footprint, temporal diameter, and round trip temporal diameter, and with T-interval connectivity which is a maximization problem. We prove that the problems are in NC by presenting polylogarithmic-time parallel versions of the algorithms. Finally, we show that the algorithms can operate online with amortized complexity Θ(1) composition and test operations for each graph in the sequence.
    31 schema:genre research_article
    32 schema:inLanguage en
    33 schema:isAccessibleForFree false
    34 schema:isPartOf N67092b56b9c247f3a59b6b61e37f4547
    35 Nd5c4a7ab61754e248de712a220e777e4
    36 sg:journal.1052098
    37 schema:name Computing Parameters of Sequence-Based Dynamic Graphs
    38 schema:pagination 1-24
    39 schema:productId N239f59052ed045e8a002b66e295ec14a
    40 Na855b091870d481bbcd85fdcac29a19c
    41 Na9e4bcbbba7b4feda5512038a8629467
    42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1105601643
    43 https://doi.org/10.1007/s00224-018-9876-z
    44 schema:sdDatePublished 2019-04-11T14:03
    45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    46 schema:sdPublisher N42f91b91b19248bfa476970eb3941f4e
    47 schema:url https://link.springer.com/10.1007%2Fs00224-018-9876-z
    48 sgo:license sg:explorer/license/
    49 sgo:sdDataset articles
    50 rdf:type schema:ScholarlyArticle
    51 N0762d4760c934b4aabb6d2976d5fe828 schema:name LaBRI, CNRS, University of Bordeaux, Talence, France
    52 rdf:type schema:Organization
    53 N07cb2bfbe5984b178cd374154c50f4d7 rdf:first sg:person.012743642445.24
    54 rdf:rest N0b235fb557914d5a865781279eb6e5fe
    55 N0b235fb557914d5a865781279eb6e5fe rdf:first sg:person.015627506034.65
    56 rdf:rest rdf:nil
    57 N239f59052ed045e8a002b66e295ec14a schema:name readcube_id
    58 schema:value 28234e460ddf38457e94950bb633fc4adcab81af1e3391094d8a5e6180b5b6f4
    59 rdf:type schema:PropertyValue
    60 N42f91b91b19248bfa476970eb3941f4e schema:name Springer Nature - SN SciGraph project
    61 rdf:type schema:Organization
    62 N67092b56b9c247f3a59b6b61e37f4547 schema:issueNumber 3
    63 rdf:type schema:PublicationIssue
    64 N9dad3255f40f41cd8dd2d8c4f92cb992 rdf:first sg:person.016012765273.46
    65 rdf:rest N07cb2bfbe5984b178cd374154c50f4d7
    66 Na855b091870d481bbcd85fdcac29a19c schema:name doi
    67 schema:value 10.1007/s00224-018-9876-z
    68 rdf:type schema:PropertyValue
    69 Na9e4bcbbba7b4feda5512038a8629467 schema:name dimensions_id
    70 schema:value pub.1105601643
    71 rdf:type schema:PropertyValue
    72 Nd13f251be7484e70a8c5bff2e059c4b4 rdf:first sg:person.014046062661.61
    73 rdf:rest N9dad3255f40f41cd8dd2d8c4f92cb992
    74 Nd5c4a7ab61754e248de712a220e777e4 schema:volumeNumber 63
    75 rdf:type schema:PublicationVolume
    76 Nfa757a2debc2413fac3645abc5744871 schema:name LaBRI, CNRS, University of Bordeaux, Talence, France
    77 rdf:type schema:Organization
    78 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    79 schema:name Information and Computing Sciences
    80 rdf:type schema:DefinedTerm
    81 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    82 schema:name Computation Theory and Mathematics
    83 rdf:type schema:DefinedTerm
    84 sg:journal.1052098 schema:issn 1432-4350
    85 1433-0490
    86 schema:name Theory of Computing Systems
    87 rdf:type schema:Periodical
    88 sg:person.012743642445.24 schema:affiliation https://www.grid.ac/institutes/grid.462430.7
    89 schema:familyName Neggaz
    90 schema:givenName Yessin M.
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012743642445.24
    92 rdf:type schema:Person
    93 sg:person.014046062661.61 schema:affiliation Nfa757a2debc2413fac3645abc5744871
    94 schema:familyName Casteigts
    95 schema:givenName Arnaud
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014046062661.61
    97 rdf:type schema:Person
    98 sg:person.015627506034.65 schema:affiliation https://www.grid.ac/institutes/grid.61971.38
    99 schema:familyName Peters
    100 schema:givenName Joseph G.
    101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015627506034.65
    102 rdf:type schema:Person
    103 sg:person.016012765273.46 schema:affiliation N0762d4760c934b4aabb6d2976d5fe828
    104 schema:familyName Klasing
    105 schema:givenName Ralf
    106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016012765273.46
    107 rdf:type schema:Person
    108 sg:pub.10.1007/978-3-319-12340-0_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051869454
    109 https://doi.org/10.1007/978-3-319-12340-0_3
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/978-3-319-18173-8_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027662009
    112 https://doi.org/10.1007/978-3-319-18173-8_6
    113 rdf:type schema:CreativeWork
    114 sg:pub.10.1007/978-3-319-21741-3_4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036207392
    115 https://doi.org/10.1007/978-3-319-21741-3_4
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1007/978-3-319-49259-9_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048432832
    118 https://doi.org/10.1007/978-3-319-49259-9_5
    119 rdf:type schema:CreativeWork
    120 sg:pub.10.1007/978-3-319-72050-0_19 schema:sameAs https://app.dimensions.ai/details/publication/pub.1100108568
    121 https://doi.org/10.1007/978-3-319-72050-0_19
    122 rdf:type schema:CreativeWork
    123 sg:pub.10.1007/978-3-642-11476-2_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021306868
    124 https://doi.org/10.1007/978-3-642-11476-2_11
    125 rdf:type schema:CreativeWork
    126 sg:pub.10.1007/978-3-662-46018-4_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011019112
    127 https://doi.org/10.1007/978-3-662-46018-4_6
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1016/j.ic.2016.12.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043477245
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1016/j.tcs.2012.10.029 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012732800
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1016/j.tcs.2013.12.024 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002304973
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1016/j.tcs.2015.09.030 schema:sameAs https://app.dimensions.ai/details/publication/pub.1017583432
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1080/17445760.2012.668546 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005693413
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1109/aina.2014.115 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095529953
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1109/ipdps.2006.1639347 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094792169
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1109/tc.2012.208 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061535334
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1137/0201010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841173
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.1142/s0129054103001728 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062896465
    148 rdf:type schema:CreativeWork
    149 https://doi.org/10.1142/s0129054115500288 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062897477
    150 rdf:type schema:CreativeWork
    151 https://doi.org/10.1145/1015467.1015484 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042134783
    152 rdf:type schema:CreativeWork
    153 https://doi.org/10.1145/1030194.1015484 schema:sameAs https://app.dimensions.ai/details/publication/pub.1063149264
    154 rdf:type schema:CreativeWork
    155 https://doi.org/10.1145/1806689.1806760 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046808496
    156 rdf:type schema:CreativeWork
    157 https://doi.org/10.1145/2348543.2348589 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045787074
    158 rdf:type schema:CreativeWork
    159 https://doi.org/10.1145/800222.806754 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018316918
    160 rdf:type schema:CreativeWork
    161 https://doi.org/10.15803/ijnc.6.1_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048588304
    162 rdf:type schema:CreativeWork
    163 https://www.grid.ac/institutes/grid.462430.7 schema:alternateName Laboratory for Analysis and Architecture of Systems
    164 schema:name LAAS-CNRS, INSA-Toulouse, Toulouse, France
    165 rdf:type schema:Organization
    166 https://www.grid.ac/institutes/grid.61971.38 schema:alternateName Simon Fraser University
    167 schema:name School of Computing Science, Simon Fraser University, Burnaby, BC, Canada
    168 rdf:type schema:Organization
     




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


    ...