Temporal Network Optimization Subject to Connectivity Constraints View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2019-04

AUTHORS

George B. Mertzios, Othon Michail, Paul G. Spirakis

ABSTRACT

In this work we consider temporal networks, i.e. networks defined by a labelingλ assigning to each edge of an underlying graphG a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular, we consider time-respecting paths, i.e. paths whose edges are assigned by λ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respecting paths on a temporal network. We then prove that there is a natural analogue of Menger’s theorem holding for arbitrary temporal networks. Finally, we propose two cost minimization parameters for temporal network design. One is the temporality of G, in which the goal is to minimize the maximum number of labels of an edge, and the other is the temporal cost of G, in which the goal is to minimize the total number of labels used. Optimization of these parameters is performed subject to some connectivity constraint. We prove several lower and upper bounds for the temporality and the temporal cost of some very basic graph families such as rings, directed acyclic graphs, and trees. More... »

PAGES

1-34

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00453-018-0478-6

DOI

http://dx.doi.org/10.1007/s00453-018-0478-6

DIMENSIONS

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


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": {
          "alternateName": "Durham University", 
          "id": "https://www.grid.ac/institutes/grid.8250.f", 
          "name": [
            "Department of Computer Science, Durham University, Durham, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mertzios", 
        "givenName": "George B.", 
        "id": "sg:person.07470745761.85", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07470745761.85"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Liverpool", 
          "id": "https://www.grid.ac/institutes/grid.10025.36", 
          "name": [
            "Department of Computer Science, University of Liverpool, Liverpool, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Michail", 
        "givenName": "Othon", 
        "id": "sg:person.014021455260.80", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014021455260.80"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Patras", 
          "id": "https://www.grid.ac/institutes/grid.11047.33", 
          "name": [
            "Department of Computer Science, University of Liverpool, Liverpool, UK", 
            "Department of Computer Engineering and Informatics, University of Patras, Patras, Greece"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Spirakis", 
        "givenName": "Paul G.", 
        "id": "sg:person.010266654244.33", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010266654244.33"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1002/(sici)1097-0037(199610)28:3<125::aid-net1>3.0.co;2-p", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002397178"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/28869.28874", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002799108"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/17445760.2012.668546", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1005693413"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1010623407", 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-04016-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010623407", 
          "https://doi.org/10.1007/978-3-642-04016-0"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-04016-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010623407", 
          "https://doi.org/10.1007/978-3-642-04016-0"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4612-0619-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011696368", 
          "https://doi.org/10.1007/978-1-4612-0619-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4612-0619-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011696368", 
          "https://doi.org/10.1007/978-1-4612-0619-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-70575-8_11", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1027002019", 
          "https://doi.org/10.1007/978-3-540-70575-8_11"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-39212-2_57", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031419154", 
          "https://doi.org/10.1007/978-3-642-39212-2_57"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.jpdc.2013.07.007", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033762362"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/351827.384254", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035199094"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45841-7_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037914310", 
          "https://doi.org/10.1007/3-540-45841-7_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45841-7_2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037914310", 
          "https://doi.org/10.1007/3-540-45841-7_2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/335305.335364", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039109346"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0167-6377(98)00037-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1040345374"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-62592-5_80", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042261594", 
          "https://doi.org/10.1007/3-540-62592-5_80"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1080810.1080828", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042859157"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1400751.1400781", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1043346600"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2011.02.003", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044045520"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-74247-0_3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045952048", 
          "https://doi.org/10.1007/978-3-540-74247-0_3"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-74247-0_3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045952048", 
          "https://doi.org/10.1007/978-3-540-74247-0_3"
        ], 
        "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/s00446-005-0138-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047674948", 
          "https://doi.org/10.1007/s00446-005-0138-3"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00446-005-0138-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047674948", 
          "https://doi.org/10.1007/s00446-005-0138-3"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1080/15427951.2016.1177801", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052521242"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539703433912", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062879473"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539795286612", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062880037"
        ], 
        "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.2200/s00328ed1v01y201101dct006", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069288210"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1.9781611973105.52", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1088801659"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1.9780898718546", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1098557265"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2019-04", 
    "datePublishedReg": "2019-04-01", 
    "description": "In this work we consider temporal networks, i.e. networks defined by a labeling\u03bb assigning to each edge of an underlying graphG a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular, we consider time-respecting paths, i.e. paths whose edges are assigned by \u03bb a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respecting paths on a temporal network. We then prove that there is a natural analogue of Menger\u2019s theorem holding for arbitrary temporal networks. Finally, we propose two cost minimization parameters for temporal network design. One is the temporality of G, in which the goal is to minimize the maximum number of labels of an edge, and the other is the temporal cost of G, in which the goal is to minimize the total number of labels used. Optimization of these parameters is performed subject to some connectivity constraint. We prove several lower and upper bounds for the temporality and the temporal cost of some very basic graph families such as rings, directed acyclic graphs, and trees.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00453-018-0478-6", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.2756238", 
        "type": "MonetaryGrant"
      }, 
      {
        "id": "sg:grant.6621146", 
        "type": "MonetaryGrant"
      }, 
      {
        "id": "sg:grant.3791124", 
        "type": "MonetaryGrant"
      }, 
      {
        "id": "sg:grant.6619668", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1047644", 
        "issn": [
          "0178-4617", 
          "1432-0541"
        ], 
        "name": "Algorithmica", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "4", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "81"
      }
    ], 
    "name": "Temporal Network Optimization Subject to Connectivity Constraints", 
    "pagination": "1-34", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "523c915dbf5fa2585f56d7eead08b74fe55a4f03e2c14294ac2a2f3af713d031"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00453-018-0478-6"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1105317517"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00453-018-0478-6", 
      "https://app.dimensions.ai/details/publication/pub.1105317517"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T14:21", 
    "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/0000000372_0000000372/records_117125_00000003.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs00453-018-0478-6"
  }
]
 

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/s00453-018-0478-6'

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/s00453-018-0478-6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00453-018-0478-6'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00453-018-0478-6'


 

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

178 TRIPLES      21 PREDICATES      54 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00453-018-0478-6 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Na47a1b7b939247bbb5a17e508ed1518c
4 schema:citation sg:pub.10.1007/3-540-45841-7_2
5 sg:pub.10.1007/3-540-62592-5_80
6 sg:pub.10.1007/978-1-4612-0619-4
7 sg:pub.10.1007/978-3-540-70575-8_11
8 sg:pub.10.1007/978-3-540-74247-0_3
9 sg:pub.10.1007/978-3-642-04016-0
10 sg:pub.10.1007/978-3-642-39212-2_57
11 sg:pub.10.1007/s00446-005-0138-3
12 https://app.dimensions.ai/details/publication/pub.1010623407
13 https://doi.org/10.1002/(sici)1097-0037(199610)28:3<125::aid-net1>3.0.co;2-p
14 https://doi.org/10.1016/j.jpdc.2013.07.007
15 https://doi.org/10.1016/j.tcs.2011.02.003
16 https://doi.org/10.1016/s0167-6377(98)00037-6
17 https://doi.org/10.1080/15427951.2016.1177801
18 https://doi.org/10.1080/17445760.2012.668546
19 https://doi.org/10.1137/1.9780898718546
20 https://doi.org/10.1137/1.9781611973105.52
21 https://doi.org/10.1137/s0097539703433912
22 https://doi.org/10.1137/s0097539795286612
23 https://doi.org/10.1142/s0129054103001728
24 https://doi.org/10.1145/1080810.1080828
25 https://doi.org/10.1145/1400751.1400781
26 https://doi.org/10.1145/1806689.1806760
27 https://doi.org/10.1145/28869.28874
28 https://doi.org/10.1145/335305.335364
29 https://doi.org/10.1145/351827.384254
30 https://doi.org/10.2200/s00328ed1v01y201101dct006
31 schema:datePublished 2019-04
32 schema:datePublishedReg 2019-04-01
33 schema:description In this work we consider temporal networks, i.e. networks defined by a labelingλ assigning to each edge of an underlying graphG a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular, we consider time-respecting paths, i.e. paths whose edges are assigned by λ a strictly increasing sequence of labels. We begin by giving two efficient algorithms for computing shortest time-respecting paths on a temporal network. We then prove that there is a natural analogue of Menger’s theorem holding for arbitrary temporal networks. Finally, we propose two cost minimization parameters for temporal network design. One is the temporality of G, in which the goal is to minimize the maximum number of labels of an edge, and the other is the temporal cost of G, in which the goal is to minimize the total number of labels used. Optimization of these parameters is performed subject to some connectivity constraint. We prove several lower and upper bounds for the temporality and the temporal cost of some very basic graph families such as rings, directed acyclic graphs, and trees.
34 schema:genre research_article
35 schema:inLanguage en
36 schema:isAccessibleForFree true
37 schema:isPartOf N1a25c604e3d942278fe3a46670d57026
38 N7f8991a5839e4deea4f52e20acc14d20
39 sg:journal.1047644
40 schema:name Temporal Network Optimization Subject to Connectivity Constraints
41 schema:pagination 1-34
42 schema:productId N20d88f2b2e3c4d4d995ee957fb493473
43 N21294dc25c914ea1aae4da549579043e
44 Nac7f62ed2fab498eb1b5ca0c6654f505
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1105317517
46 https://doi.org/10.1007/s00453-018-0478-6
47 schema:sdDatePublished 2019-04-11T14:21
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher N30040867511748d48d8796d4a8700ab8
50 schema:url https://link.springer.com/10.1007%2Fs00453-018-0478-6
51 sgo:license sg:explorer/license/
52 sgo:sdDataset articles
53 rdf:type schema:ScholarlyArticle
54 N1a25c604e3d942278fe3a46670d57026 schema:issueNumber 4
55 rdf:type schema:PublicationIssue
56 N20d88f2b2e3c4d4d995ee957fb493473 schema:name doi
57 schema:value 10.1007/s00453-018-0478-6
58 rdf:type schema:PropertyValue
59 N21294dc25c914ea1aae4da549579043e schema:name dimensions_id
60 schema:value pub.1105317517
61 rdf:type schema:PropertyValue
62 N30040867511748d48d8796d4a8700ab8 schema:name Springer Nature - SN SciGraph project
63 rdf:type schema:Organization
64 N7f8991a5839e4deea4f52e20acc14d20 schema:volumeNumber 81
65 rdf:type schema:PublicationVolume
66 Na47a1b7b939247bbb5a17e508ed1518c rdf:first sg:person.07470745761.85
67 rdf:rest Na6151a52197e4cef8d48e781a43c3f43
68 Na6151a52197e4cef8d48e781a43c3f43 rdf:first sg:person.014021455260.80
69 rdf:rest Nd63441e3452e4617b7459c91831e1fbe
70 Nac7f62ed2fab498eb1b5ca0c6654f505 schema:name readcube_id
71 schema:value 523c915dbf5fa2585f56d7eead08b74fe55a4f03e2c14294ac2a2f3af713d031
72 rdf:type schema:PropertyValue
73 Nd63441e3452e4617b7459c91831e1fbe rdf:first sg:person.010266654244.33
74 rdf:rest rdf:nil
75 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
76 schema:name Information and Computing Sciences
77 rdf:type schema:DefinedTerm
78 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
79 schema:name Computation Theory and Mathematics
80 rdf:type schema:DefinedTerm
81 sg:grant.2756238 http://pending.schema.org/fundedItem sg:pub.10.1007/s00453-018-0478-6
82 rdf:type schema:MonetaryGrant
83 sg:grant.3791124 http://pending.schema.org/fundedItem sg:pub.10.1007/s00453-018-0478-6
84 rdf:type schema:MonetaryGrant
85 sg:grant.6619668 http://pending.schema.org/fundedItem sg:pub.10.1007/s00453-018-0478-6
86 rdf:type schema:MonetaryGrant
87 sg:grant.6621146 http://pending.schema.org/fundedItem sg:pub.10.1007/s00453-018-0478-6
88 rdf:type schema:MonetaryGrant
89 sg:journal.1047644 schema:issn 0178-4617
90 1432-0541
91 schema:name Algorithmica
92 rdf:type schema:Periodical
93 sg:person.010266654244.33 schema:affiliation https://www.grid.ac/institutes/grid.11047.33
94 schema:familyName Spirakis
95 schema:givenName Paul G.
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010266654244.33
97 rdf:type schema:Person
98 sg:person.014021455260.80 schema:affiliation https://www.grid.ac/institutes/grid.10025.36
99 schema:familyName Michail
100 schema:givenName Othon
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014021455260.80
102 rdf:type schema:Person
103 sg:person.07470745761.85 schema:affiliation https://www.grid.ac/institutes/grid.8250.f
104 schema:familyName Mertzios
105 schema:givenName George B.
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07470745761.85
107 rdf:type schema:Person
108 sg:pub.10.1007/3-540-45841-7_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037914310
109 https://doi.org/10.1007/3-540-45841-7_2
110 rdf:type schema:CreativeWork
111 sg:pub.10.1007/3-540-62592-5_80 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042261594
112 https://doi.org/10.1007/3-540-62592-5_80
113 rdf:type schema:CreativeWork
114 sg:pub.10.1007/978-1-4612-0619-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011696368
115 https://doi.org/10.1007/978-1-4612-0619-4
116 rdf:type schema:CreativeWork
117 sg:pub.10.1007/978-3-540-70575-8_11 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027002019
118 https://doi.org/10.1007/978-3-540-70575-8_11
119 rdf:type schema:CreativeWork
120 sg:pub.10.1007/978-3-540-74247-0_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045952048
121 https://doi.org/10.1007/978-3-540-74247-0_3
122 rdf:type schema:CreativeWork
123 sg:pub.10.1007/978-3-642-04016-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010623407
124 https://doi.org/10.1007/978-3-642-04016-0
125 rdf:type schema:CreativeWork
126 sg:pub.10.1007/978-3-642-39212-2_57 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031419154
127 https://doi.org/10.1007/978-3-642-39212-2_57
128 rdf:type schema:CreativeWork
129 sg:pub.10.1007/s00446-005-0138-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047674948
130 https://doi.org/10.1007/s00446-005-0138-3
131 rdf:type schema:CreativeWork
132 https://app.dimensions.ai/details/publication/pub.1010623407 schema:CreativeWork
133 https://doi.org/10.1002/(sici)1097-0037(199610)28:3<125::aid-net1>3.0.co;2-p schema:sameAs https://app.dimensions.ai/details/publication/pub.1002397178
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1016/j.jpdc.2013.07.007 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033762362
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1016/j.tcs.2011.02.003 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044045520
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1016/s0167-6377(98)00037-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040345374
140 rdf:type schema:CreativeWork
141 https://doi.org/10.1080/15427951.2016.1177801 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052521242
142 rdf:type schema:CreativeWork
143 https://doi.org/10.1080/17445760.2012.668546 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005693413
144 rdf:type schema:CreativeWork
145 https://doi.org/10.1137/1.9780898718546 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098557265
146 rdf:type schema:CreativeWork
147 https://doi.org/10.1137/1.9781611973105.52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1088801659
148 rdf:type schema:CreativeWork
149 https://doi.org/10.1137/s0097539703433912 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062879473
150 rdf:type schema:CreativeWork
151 https://doi.org/10.1137/s0097539795286612 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062880037
152 rdf:type schema:CreativeWork
153 https://doi.org/10.1142/s0129054103001728 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062896465
154 rdf:type schema:CreativeWork
155 https://doi.org/10.1145/1080810.1080828 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042859157
156 rdf:type schema:CreativeWork
157 https://doi.org/10.1145/1400751.1400781 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043346600
158 rdf:type schema:CreativeWork
159 https://doi.org/10.1145/1806689.1806760 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046808496
160 rdf:type schema:CreativeWork
161 https://doi.org/10.1145/28869.28874 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002799108
162 rdf:type schema:CreativeWork
163 https://doi.org/10.1145/335305.335364 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039109346
164 rdf:type schema:CreativeWork
165 https://doi.org/10.1145/351827.384254 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035199094
166 rdf:type schema:CreativeWork
167 https://doi.org/10.2200/s00328ed1v01y201101dct006 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069288210
168 rdf:type schema:CreativeWork
169 https://www.grid.ac/institutes/grid.10025.36 schema:alternateName University of Liverpool
170 schema:name Department of Computer Science, University of Liverpool, Liverpool, UK
171 rdf:type schema:Organization
172 https://www.grid.ac/institutes/grid.11047.33 schema:alternateName University of Patras
173 schema:name Department of Computer Engineering and Informatics, University of Patras, Patras, Greece
174 Department of Computer Science, University of Liverpool, Liverpool, UK
175 rdf:type schema:Organization
176 https://www.grid.ac/institutes/grid.8250.f schema:alternateName Durham University
177 schema:name Department of Computer Science, Durham University, Durham, UK
178 rdf:type schema:Organization
 




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


...