An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2019-01-25

AUTHORS

Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti

ABSTRACT

A treeσ-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a multiplicative stretch factorσ) distances in G. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in T, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., computational costs, set-up of new links, updating of the routing tables, etc.) can be rather prohibitive. To circumvent this drawback, an effective alternative is that of associating with each tree edge a best possible (in terms of resulting stretch) swap edge—a well-established approach in the literature for several other tree topologies. Correspondingly, the problem of computing all the best swap edges of a tree spanner is a challenging algorithmic problem, since solving it efficiently means to exploit the structure of shortest paths not only in G, but also in all the scenarios in which an edge of T has failed. For this problem we provide a very efficient solution, running in O(n2log4n) time, which drastically improves (almost by a quadratic factor in n in dense graphs) on the previous known best result. More... »

PAGES

1-21

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00453-019-00549-w

DOI

http://dx.doi.org/10.1007/s00453-019-00549-w

DIMENSIONS

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


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": "University of Sassari", 
          "id": "https://www.grid.ac/institutes/grid.11450.31", 
          "name": [
            "Universit\u00e0 di Sassari, Sassari, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bil\u00f2", 
        "givenName": "Davide", 
        "id": "sg:person.010426216501.26", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010426216501.26"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Gran Sasso Science Institute", 
          "id": "https://www.grid.ac/institutes/grid.466750.6", 
          "name": [
            "Gran Sasso Science Institute, L\u2019Aquila, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Colella", 
        "givenName": "Feliciano", 
        "id": "sg:person.07404316352.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07404316352.32"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Rome Tor Vergata", 
          "id": "https://www.grid.ac/institutes/grid.6530.0", 
          "name": [
            "Universit\u00e0 di Roma \u201cTor Vergata\u201d, Rome, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gual\u00e0", 
        "givenName": "Luciano", 
        "id": "sg:person.012616540101.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012616540101.45"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Swiss Federal Institute of Technology in Zurich", 
          "id": "https://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Z\u00fcrich, Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Leucci", 
        "givenName": "Stefano", 
        "id": "sg:person.010027421073.44", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010027421073.44"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti", 
          "id": "https://www.grid.ac/institutes/grid.419461.f", 
          "name": [
            "Universit\u00e0 degli Studi dell\u2019Aquila, L\u2019Aquila, Italy", 
            "Istituto di Analisi dei Sistemi ed Informatica, CNR, Rome, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Proietti", 
        "givenName": "Guido", 
        "id": "sg:person.015510625760.85", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015510625760.85"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-319-25258-2_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006583935", 
          "https://doi.org/10.1007/978-3-319-25258-2_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1515/crll.1869.70.185", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011111683"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/pl00009225", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011504905", 
          "https://doi.org/10.1007/pl00009225"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-007-9080-z", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012135178", 
          "https://doi.org/10.1007/s00453-007-9080-z"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-007-9080-z", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012135178", 
          "https://doi.org/10.1007/s00453-007-9080-z"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0020-0190(00)00175-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015696603"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11602613_96", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019597701", 
          "https://doi.org/10.1007/11602613_96"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/11602613_96", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019597701", 
          "https://doi.org/10.1007/11602613_96"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-44691-5_18", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021999389", 
          "https://doi.org/10.1007/3-540-44691-5_18"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-012-9674-y", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1023126388", 
          "https://doi.org/10.1007/s00453-012-9674-y"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/jagm.1998.0962", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029588756"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0020-0190(82)90137-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029724176"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.tcs.2007.03.046", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031272404"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-004-1099-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034786195", 
          "https://doi.org/10.1007/s00453-004-1099-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1103963.1103966", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041242664"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-014-9912-6", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1044539550", 
          "https://doi.org/10.1007/s00453-014-9912-6"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.dam.2007.07.001", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1053630272"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/060666202", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062849587"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0895480192237403", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062882876"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.7155/jgaa.00208", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1073626494"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.1985.3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086208008"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2002.1181985", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093627487"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-319-72050-0_18", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1100111710", 
          "https://doi.org/10.1007/978-3-319-72050-0_18"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2019-01-25", 
    "datePublishedReg": "2019-01-25", 
    "description": "A tree\u03c3-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a multiplicative stretch factor\u03c3) distances in G. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in T, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., computational costs, set-up of new links, updating of the routing tables, etc.) can be rather prohibitive. To circumvent this drawback, an effective alternative is that of associating with each tree edge a best possible (in terms of resulting stretch) swap edge\u2014a well-established approach in the literature for several other tree topologies. Correspondingly, the problem of computing all the best swap edges of a tree spanner is a challenging algorithmic problem, since solving it efficiently means to exploit the structure of shortest paths not only in G, but also in all the scenarios in which an edge of T has failed. For this problem we provide a very efficient solution, running in O(n2log4n) time, which drastically improves (almost by a quadratic factor in n in dense graphs) on the previous known best result.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00453-019-00549-w", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1047644", 
        "issn": [
          "0178-4617", 
          "1432-0541"
        ], 
        "name": "Algorithmica", 
        "type": "Periodical"
      }
    ], 
    "name": "An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner", 
    "pagination": "1-21", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "5ca0d6b21fb4a1c17f4a175792bfa0eb0a46f7d18f057401c51ea910d7212d82"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00453-019-00549-w"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1111658004"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00453-019-00549-w", 
      "https://app.dimensions.ai/details/publication/pub.1111658004"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T08:56", 
    "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/0000000325_0000000325/records_100797_00000000.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs00453-019-00549-w"
  }
]
 

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-019-00549-w'

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-019-00549-w'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00453-019-00549-w'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00453-019-00549-w'


 

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

168 TRIPLES      21 PREDICATES      45 URIs      16 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00453-019-00549-w schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N1ea20acedfe345e8b402c529c02d4b81
4 schema:citation sg:pub.10.1007/11602613_96
5 sg:pub.10.1007/3-540-44691-5_18
6 sg:pub.10.1007/978-3-319-25258-2_17
7 sg:pub.10.1007/978-3-319-72050-0_18
8 sg:pub.10.1007/pl00009225
9 sg:pub.10.1007/s00453-004-1099-9
10 sg:pub.10.1007/s00453-007-9080-z
11 sg:pub.10.1007/s00453-012-9674-y
12 sg:pub.10.1007/s00453-014-9912-6
13 https://doi.org/10.1006/jagm.1998.0962
14 https://doi.org/10.1016/0020-0190(82)90137-5
15 https://doi.org/10.1016/j.dam.2007.07.001
16 https://doi.org/10.1016/j.tcs.2007.03.046
17 https://doi.org/10.1016/s0020-0190(00)00175-7
18 https://doi.org/10.1109/sfcs.1985.3
19 https://doi.org/10.1109/sfcs.2002.1181985
20 https://doi.org/10.1137/060666202
21 https://doi.org/10.1137/s0895480192237403
22 https://doi.org/10.1145/1103963.1103966
23 https://doi.org/10.1515/crll.1869.70.185
24 https://doi.org/10.7155/jgaa.00208
25 schema:datePublished 2019-01-25
26 schema:datePublishedReg 2019-01-25
27 schema:description A treeσ-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a multiplicative stretch factorσ) distances in G. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner is a very hard computational task. Thus, if one has to face a transient edge failure in T, the overall effort that has to be afforded to rebuild a new tree spanner (i.e., computational costs, set-up of new links, updating of the routing tables, etc.) can be rather prohibitive. To circumvent this drawback, an effective alternative is that of associating with each tree edge a best possible (in terms of resulting stretch) swap edge—a well-established approach in the literature for several other tree topologies. Correspondingly, the problem of computing all the best swap edges of a tree spanner is a challenging algorithmic problem, since solving it efficiently means to exploit the structure of shortest paths not only in G, but also in all the scenarios in which an edge of T has failed. For this problem we provide a very efficient solution, running in O(n2log4n) time, which drastically improves (almost by a quadratic factor in n in dense graphs) on the previous known best result.
28 schema:genre research_article
29 schema:inLanguage en
30 schema:isAccessibleForFree true
31 schema:isPartOf sg:journal.1047644
32 schema:name An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
33 schema:pagination 1-21
34 schema:productId N201d52c31b2d4811861ca31a8aaffcf8
35 N67478d9d436649b993d03fe8be2ad06c
36 N9e638b0998584608bd4e530de24834ad
37 schema:sameAs https://app.dimensions.ai/details/publication/pub.1111658004
38 https://doi.org/10.1007/s00453-019-00549-w
39 schema:sdDatePublished 2019-04-11T08:56
40 schema:sdLicense https://scigraph.springernature.com/explorer/license/
41 schema:sdPublisher N18f9a9c84e9044f7aeabf5ae20f96b9e
42 schema:url https://link.springer.com/10.1007%2Fs00453-019-00549-w
43 sgo:license sg:explorer/license/
44 sgo:sdDataset articles
45 rdf:type schema:ScholarlyArticle
46 N18f9a9c84e9044f7aeabf5ae20f96b9e schema:name Springer Nature - SN SciGraph project
47 rdf:type schema:Organization
48 N1ea20acedfe345e8b402c529c02d4b81 rdf:first sg:person.010426216501.26
49 rdf:rest N28c2e3ed26fd444fb0f25ab0c23e6e20
50 N201d52c31b2d4811861ca31a8aaffcf8 schema:name readcube_id
51 schema:value 5ca0d6b21fb4a1c17f4a175792bfa0eb0a46f7d18f057401c51ea910d7212d82
52 rdf:type schema:PropertyValue
53 N28c2e3ed26fd444fb0f25ab0c23e6e20 rdf:first sg:person.07404316352.32
54 rdf:rest N61217cb343ae418e9c72b1d90c63fbd6
55 N2a34d82f27dd49f590703abe46a8c091 rdf:first sg:person.010027421073.44
56 rdf:rest N911ac16bba6244d19627a5a4e6022f39
57 N61217cb343ae418e9c72b1d90c63fbd6 rdf:first sg:person.012616540101.45
58 rdf:rest N2a34d82f27dd49f590703abe46a8c091
59 N67478d9d436649b993d03fe8be2ad06c schema:name dimensions_id
60 schema:value pub.1111658004
61 rdf:type schema:PropertyValue
62 N911ac16bba6244d19627a5a4e6022f39 rdf:first sg:person.015510625760.85
63 rdf:rest rdf:nil
64 N9e638b0998584608bd4e530de24834ad schema:name doi
65 schema:value 10.1007/s00453-019-00549-w
66 rdf:type schema:PropertyValue
67 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
68 schema:name Information and Computing Sciences
69 rdf:type schema:DefinedTerm
70 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
71 schema:name Computation Theory and Mathematics
72 rdf:type schema:DefinedTerm
73 sg:journal.1047644 schema:issn 0178-4617
74 1432-0541
75 schema:name Algorithmica
76 rdf:type schema:Periodical
77 sg:person.010027421073.44 schema:affiliation https://www.grid.ac/institutes/grid.5801.c
78 schema:familyName Leucci
79 schema:givenName Stefano
80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010027421073.44
81 rdf:type schema:Person
82 sg:person.010426216501.26 schema:affiliation https://www.grid.ac/institutes/grid.11450.31
83 schema:familyName Bilò
84 schema:givenName Davide
85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010426216501.26
86 rdf:type schema:Person
87 sg:person.012616540101.45 schema:affiliation https://www.grid.ac/institutes/grid.6530.0
88 schema:familyName Gualà
89 schema:givenName Luciano
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012616540101.45
91 rdf:type schema:Person
92 sg:person.015510625760.85 schema:affiliation https://www.grid.ac/institutes/grid.419461.f
93 schema:familyName Proietti
94 schema:givenName Guido
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015510625760.85
96 rdf:type schema:Person
97 sg:person.07404316352.32 schema:affiliation https://www.grid.ac/institutes/grid.466750.6
98 schema:familyName Colella
99 schema:givenName Feliciano
100 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07404316352.32
101 rdf:type schema:Person
102 sg:pub.10.1007/11602613_96 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019597701
103 https://doi.org/10.1007/11602613_96
104 rdf:type schema:CreativeWork
105 sg:pub.10.1007/3-540-44691-5_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021999389
106 https://doi.org/10.1007/3-540-44691-5_18
107 rdf:type schema:CreativeWork
108 sg:pub.10.1007/978-3-319-25258-2_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006583935
109 https://doi.org/10.1007/978-3-319-25258-2_17
110 rdf:type schema:CreativeWork
111 sg:pub.10.1007/978-3-319-72050-0_18 schema:sameAs https://app.dimensions.ai/details/publication/pub.1100111710
112 https://doi.org/10.1007/978-3-319-72050-0_18
113 rdf:type schema:CreativeWork
114 sg:pub.10.1007/pl00009225 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011504905
115 https://doi.org/10.1007/pl00009225
116 rdf:type schema:CreativeWork
117 sg:pub.10.1007/s00453-004-1099-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034786195
118 https://doi.org/10.1007/s00453-004-1099-9
119 rdf:type schema:CreativeWork
120 sg:pub.10.1007/s00453-007-9080-z schema:sameAs https://app.dimensions.ai/details/publication/pub.1012135178
121 https://doi.org/10.1007/s00453-007-9080-z
122 rdf:type schema:CreativeWork
123 sg:pub.10.1007/s00453-012-9674-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1023126388
124 https://doi.org/10.1007/s00453-012-9674-y
125 rdf:type schema:CreativeWork
126 sg:pub.10.1007/s00453-014-9912-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044539550
127 https://doi.org/10.1007/s00453-014-9912-6
128 rdf:type schema:CreativeWork
129 https://doi.org/10.1006/jagm.1998.0962 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029588756
130 rdf:type schema:CreativeWork
131 https://doi.org/10.1016/0020-0190(82)90137-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029724176
132 rdf:type schema:CreativeWork
133 https://doi.org/10.1016/j.dam.2007.07.001 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053630272
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1016/j.tcs.2007.03.046 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031272404
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1016/s0020-0190(00)00175-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015696603
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1109/sfcs.1985.3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086208008
140 rdf:type schema:CreativeWork
141 https://doi.org/10.1109/sfcs.2002.1181985 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093627487
142 rdf:type schema:CreativeWork
143 https://doi.org/10.1137/060666202 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062849587
144 rdf:type schema:CreativeWork
145 https://doi.org/10.1137/s0895480192237403 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062882876
146 rdf:type schema:CreativeWork
147 https://doi.org/10.1145/1103963.1103966 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041242664
148 rdf:type schema:CreativeWork
149 https://doi.org/10.1515/crll.1869.70.185 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011111683
150 rdf:type schema:CreativeWork
151 https://doi.org/10.7155/jgaa.00208 schema:sameAs https://app.dimensions.ai/details/publication/pub.1073626494
152 rdf:type schema:CreativeWork
153 https://www.grid.ac/institutes/grid.11450.31 schema:alternateName University of Sassari
154 schema:name Università di Sassari, Sassari, Italy
155 rdf:type schema:Organization
156 https://www.grid.ac/institutes/grid.419461.f schema:alternateName Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti
157 schema:name Istituto di Analisi dei Sistemi ed Informatica, CNR, Rome, Italy
158 Università degli Studi dell’Aquila, L’Aquila, Italy
159 rdf:type schema:Organization
160 https://www.grid.ac/institutes/grid.466750.6 schema:alternateName Gran Sasso Science Institute
161 schema:name Gran Sasso Science Institute, L’Aquila, Italy
162 rdf:type schema:Organization
163 https://www.grid.ac/institutes/grid.5801.c schema:alternateName Swiss Federal Institute of Technology in Zurich
164 schema:name ETH Zürich, Zürich, Switzerland
165 rdf:type schema:Organization
166 https://www.grid.ac/institutes/grid.6530.0 schema:alternateName University of Rome Tor Vergata
167 schema:name Università di Roma “Tor Vergata”, Rome, Italy
168 rdf:type schema:Organization
 




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


...