Parsimonious flooding in dynamic graphs View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2011-09

AUTHORS

Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud

ABSTRACT

An edge-Markovian process with birth-rate p and death-rate q generates infinite sequences of graphs (G0, G1, G2,…) with the same node set [n] such that Gt is obtained from Gt-1 as follows: if then with probability p, and if then with probability q. In this paper, we establish tight bounds on the complexity of flooding in edge-Markovian graphs, where flooding is the basic mechanism in which every node becoming aware of an information at step t forwards this information to all its neighbors at all forthcoming steps t′ > t. These bounds complete previous results obtained by Clementi et al. Moreover, we also show that flooding in dynamic graphs can be implemented in a parsimonious manner, so that to save bandwidth, yet preserving efficiency in term of simplicity and completion time. For a positive integer k, we say that the flooding protocol is k-active if each node forwards an information only during the k time steps immediately following the step at which the node receives that information for the first time. We define the reachability threshold for the flooding protocol as the smallest integer k such that, for any source , the k-active flooding protocol from s completes (i.e., reaches all nodes), and we establish tight bounds for this parameter. We show that, for a large spectrum of parameters p and q, the reachability threshold is by several orders of magnitude smaller than the flooding time. In particular, we show that it is even constant whenever the ratio p/(p + q) exceeds log n/n. Moreover, we also show that being active for a number of steps equal to the reachability threshold (up to a multiplicative constant) allows the flooding protocol to complete in optimal time, i.e., in asymptotically the same number of steps as when being perpetually active. These results demonstrate that flooding can be implemented in a practical and efficient manner in dynamic graphs. The main ingredient in the proofs of our results is a reduction lemma enabling to overcome the time dependencies in edge-Markovian dynamic graphs. More... »

PAGES

31-44

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00446-011-0133-9

DOI

http://dx.doi.org/10.1007/s00446-011-0133-9

DIMENSIONS

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


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": "Paris Diderot University", 
          "id": "https://www.grid.ac/institutes/grid.7452.4", 
          "name": [
            "Laboratoire LIAFA, CNRS and University Paris Diderot, 75205, Paris Cedex 13, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Baumann", 
        "givenName": "Herv\u00e9", 
        "id": "sg:person.016162615403.14", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016162615403.14"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Florence", 
          "id": "https://www.grid.ac/institutes/grid.8404.8", 
          "name": [
            "Dipartimento di Sistemi e Informatica, University of Florence, 50134, Florence, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Crescenzi", 
        "givenName": "Pierluigi", 
        "id": "sg:person.01173734710.11", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01173734710.11"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Paris Diderot University", 
          "id": "https://www.grid.ac/institutes/grid.7452.4", 
          "name": [
            "Laboratoire LIAFA, CNRS and University Paris Diderot, 75205, Paris Cedex 13, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fraigniaud", 
        "givenName": "Pierre", 
        "id": "sg:person.013424402135.28", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013424402135.28"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/0166-218x(85)90059-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1006274177"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-1-4757-2491-2_5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011486788", 
          "https://doi.org/10.1007/978-1-4757-2491-2_5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/aama.2001.0720", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012459805"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.jcss.2008.10.004", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1012670906"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/514191.514206", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1013143281"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0166-218x(94)90180-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021527459"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/43921.43922", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028661815"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-02930-1_32", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031200538", 
          "https://doi.org/10.1007/978-3-642-02930-1_32"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-02930-1_32", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1031200538", 
          "https://doi.org/10.1007/978-3-642-02930-1_32"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/net.3230180406", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034475756"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1039488.1039491", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036935284"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/rsa.3240010406", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041604066"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tnet.2002.801403", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061714307"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tnet.2007.892880", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061714760"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tpds.2006.85", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061753032"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0147013", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062840489"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/090756053", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062856216"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1214/07-aap470", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064389538"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/infcom.2003.1209243", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093802344"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/infcom.2007.156", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093870808"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/infcom.2003.1209237", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1094988281"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/infcom.2009.5062132", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095388734"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/ipdps.2009.5160986", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095796890"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.2002.1181971", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095825703"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1017/cbo9780511814068", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1098699402"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1106884102", 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/9781118032718", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1106884102"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1109491878", 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://app.dimensions.ai/details/publication/pub.1109491878", 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/0471722154", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1109491878"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2011-09", 
    "datePublishedReg": "2011-09-01", 
    "description": "An edge-Markovian process with birth-rate p and death-rate q generates infinite sequences of graphs (G0, G1, G2,\u2026) with the same node set [n] such that Gt is obtained from Gt-1 as follows: if then with probability p, and if then with probability q. In this paper, we establish tight bounds on the complexity of flooding in edge-Markovian graphs, where flooding is the basic mechanism in which every node becoming aware of an information at step t forwards this information to all its neighbors at all forthcoming steps t\u2032 > t. These bounds complete previous results obtained by Clementi et al. Moreover, we also show that flooding in dynamic graphs can be implemented in a parsimonious manner, so that to save bandwidth, yet preserving efficiency in term of simplicity and completion time. For a positive integer k, we say that the flooding protocol is k-active if each node forwards an information only during the k time steps immediately following the step at which the node receives that information for the first time. We define the reachability threshold for the flooding protocol as the smallest integer k such that, for any source , the k-active flooding protocol from s completes (i.e., reaches all nodes), and we establish tight bounds for this parameter. We show that, for a large spectrum of parameters p and q, the reachability threshold is by several orders of magnitude smaller than the flooding time. In particular, we show that it is even constant whenever the ratio p/(p + q) exceeds log n/n. Moreover, we also show that being active for a number of steps equal to the reachability threshold (up to a multiplicative constant) allows the flooding protocol to complete in optimal time, i.e., in asymptotically the same number of steps as when being perpetually active. These results demonstrate that flooding can be implemented in a practical and efficient manner in dynamic graphs. The main ingredient in the proofs of our results is a reduction lemma enabling to overcome the time dependencies in edge-Markovian dynamic graphs.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00446-011-0133-9", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": [
      {
        "id": "sg:journal.1052621", 
        "issn": [
          "0178-2770", 
          "1432-0452"
        ], 
        "name": "Distributed Computing", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "1", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "24"
      }
    ], 
    "name": "Parsimonious flooding in dynamic graphs", 
    "pagination": "31-44", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "96726efe5299e6d41642eb7adb59171ba1c517d5037ade2030bf1aa5245a6029"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00446-011-0133-9"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031581381"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00446-011-0133-9", 
      "https://app.dimensions.ai/details/publication/pub.1031581381"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T19:19", 
    "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_8678_00000589.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/s00446-011-0133-9"
  }
]
 

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/s00446-011-0133-9'

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/s00446-011-0133-9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00446-011-0133-9'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00446-011-0133-9'


 

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

162 TRIPLES      21 PREDICATES      55 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00446-011-0133-9 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N4d9ec51bf4074fb987346c00d40a5f93
4 schema:citation sg:pub.10.1007/978-1-4757-2491-2_5
5 sg:pub.10.1007/978-3-642-02930-1_32
6 https://app.dimensions.ai/details/publication/pub.1106884102
7 https://app.dimensions.ai/details/publication/pub.1109491878
8 https://doi.org/10.1002/0471722154
9 https://doi.org/10.1002/9781118032718
10 https://doi.org/10.1002/net.3230180406
11 https://doi.org/10.1002/rsa.3240010406
12 https://doi.org/10.1006/aama.2001.0720
13 https://doi.org/10.1016/0166-218x(85)90059-9
14 https://doi.org/10.1016/0166-218x(94)90180-5
15 https://doi.org/10.1016/j.jcss.2008.10.004
16 https://doi.org/10.1017/cbo9780511814068
17 https://doi.org/10.1109/infcom.2003.1209237
18 https://doi.org/10.1109/infcom.2003.1209243
19 https://doi.org/10.1109/infcom.2007.156
20 https://doi.org/10.1109/infcom.2009.5062132
21 https://doi.org/10.1109/ipdps.2009.5160986
22 https://doi.org/10.1109/sfcs.2002.1181971
23 https://doi.org/10.1109/tnet.2002.801403
24 https://doi.org/10.1109/tnet.2007.892880
25 https://doi.org/10.1109/tpds.2006.85
26 https://doi.org/10.1137/0147013
27 https://doi.org/10.1137/090756053
28 https://doi.org/10.1145/1039488.1039491
29 https://doi.org/10.1145/43921.43922
30 https://doi.org/10.1145/514191.514206
31 https://doi.org/10.1214/07-aap470
32 schema:datePublished 2011-09
33 schema:datePublishedReg 2011-09-01
34 schema:description An edge-Markovian process with birth-rate p and death-rate q generates infinite sequences of graphs (G0, G1, G2,…) with the same node set [n] such that Gt is obtained from Gt-1 as follows: if then with probability p, and if then with probability q. In this paper, we establish tight bounds on the complexity of flooding in edge-Markovian graphs, where flooding is the basic mechanism in which every node becoming aware of an information at step t forwards this information to all its neighbors at all forthcoming steps t′ > t. These bounds complete previous results obtained by Clementi et al. Moreover, we also show that flooding in dynamic graphs can be implemented in a parsimonious manner, so that to save bandwidth, yet preserving efficiency in term of simplicity and completion time. For a positive integer k, we say that the flooding protocol is k-active if each node forwards an information only during the k time steps immediately following the step at which the node receives that information for the first time. We define the reachability threshold for the flooding protocol as the smallest integer k such that, for any source , the k-active flooding protocol from s completes (i.e., reaches all nodes), and we establish tight bounds for this parameter. We show that, for a large spectrum of parameters p and q, the reachability threshold is by several orders of magnitude smaller than the flooding time. In particular, we show that it is even constant whenever the ratio p/(p + q) exceeds log n/n. Moreover, we also show that being active for a number of steps equal to the reachability threshold (up to a multiplicative constant) allows the flooding protocol to complete in optimal time, i.e., in asymptotically the same number of steps as when being perpetually active. These results demonstrate that flooding can be implemented in a practical and efficient manner in dynamic graphs. The main ingredient in the proofs of our results is a reduction lemma enabling to overcome the time dependencies in edge-Markovian dynamic graphs.
35 schema:genre research_article
36 schema:inLanguage en
37 schema:isAccessibleForFree true
38 schema:isPartOf N5e6e75748e9e458aace48e9667ba35fd
39 Nb5559586f9dd45cca7060e89886d2930
40 sg:journal.1052621
41 schema:name Parsimonious flooding in dynamic graphs
42 schema:pagination 31-44
43 schema:productId N12e80b784fa04788901b64f463a5a216
44 Nbf25fc8db0b246d6b30c56684525f3cc
45 Nd7693040a8f14db0be34a55394502af8
46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031581381
47 https://doi.org/10.1007/s00446-011-0133-9
48 schema:sdDatePublished 2019-04-10T19:19
49 schema:sdLicense https://scigraph.springernature.com/explorer/license/
50 schema:sdPublisher Ne92eeea470ce4504a23b6d71933209e8
51 schema:url http://link.springer.com/10.1007/s00446-011-0133-9
52 sgo:license sg:explorer/license/
53 sgo:sdDataset articles
54 rdf:type schema:ScholarlyArticle
55 N12e80b784fa04788901b64f463a5a216 schema:name dimensions_id
56 schema:value pub.1031581381
57 rdf:type schema:PropertyValue
58 N4d9ec51bf4074fb987346c00d40a5f93 rdf:first sg:person.016162615403.14
59 rdf:rest Nf405eb325122418b8e88e5d0047e31f7
60 N5e6e75748e9e458aace48e9667ba35fd schema:volumeNumber 24
61 rdf:type schema:PublicationVolume
62 Nb5559586f9dd45cca7060e89886d2930 schema:issueNumber 1
63 rdf:type schema:PublicationIssue
64 Nbf25fc8db0b246d6b30c56684525f3cc schema:name doi
65 schema:value 10.1007/s00446-011-0133-9
66 rdf:type schema:PropertyValue
67 Nc57657118ba346058328cc0110d5786f rdf:first sg:person.013424402135.28
68 rdf:rest rdf:nil
69 Nd7693040a8f14db0be34a55394502af8 schema:name readcube_id
70 schema:value 96726efe5299e6d41642eb7adb59171ba1c517d5037ade2030bf1aa5245a6029
71 rdf:type schema:PropertyValue
72 Ne92eeea470ce4504a23b6d71933209e8 schema:name Springer Nature - SN SciGraph project
73 rdf:type schema:Organization
74 Nf405eb325122418b8e88e5d0047e31f7 rdf:first sg:person.01173734710.11
75 rdf:rest Nc57657118ba346058328cc0110d5786f
76 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
77 schema:name Information and Computing Sciences
78 rdf:type schema:DefinedTerm
79 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
80 schema:name Computation Theory and Mathematics
81 rdf:type schema:DefinedTerm
82 sg:journal.1052621 schema:issn 0178-2770
83 1432-0452
84 schema:name Distributed Computing
85 rdf:type schema:Periodical
86 sg:person.01173734710.11 schema:affiliation https://www.grid.ac/institutes/grid.8404.8
87 schema:familyName Crescenzi
88 schema:givenName Pierluigi
89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01173734710.11
90 rdf:type schema:Person
91 sg:person.013424402135.28 schema:affiliation https://www.grid.ac/institutes/grid.7452.4
92 schema:familyName Fraigniaud
93 schema:givenName Pierre
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013424402135.28
95 rdf:type schema:Person
96 sg:person.016162615403.14 schema:affiliation https://www.grid.ac/institutes/grid.7452.4
97 schema:familyName Baumann
98 schema:givenName Hervé
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016162615403.14
100 rdf:type schema:Person
101 sg:pub.10.1007/978-1-4757-2491-2_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011486788
102 https://doi.org/10.1007/978-1-4757-2491-2_5
103 rdf:type schema:CreativeWork
104 sg:pub.10.1007/978-3-642-02930-1_32 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031200538
105 https://doi.org/10.1007/978-3-642-02930-1_32
106 rdf:type schema:CreativeWork
107 https://app.dimensions.ai/details/publication/pub.1106884102 schema:CreativeWork
108 https://app.dimensions.ai/details/publication/pub.1109491878 schema:CreativeWork
109 https://doi.org/10.1002/0471722154 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109491878
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1002/9781118032718 schema:sameAs https://app.dimensions.ai/details/publication/pub.1106884102
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1002/net.3230180406 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034475756
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1002/rsa.3240010406 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041604066
116 rdf:type schema:CreativeWork
117 https://doi.org/10.1006/aama.2001.0720 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012459805
118 rdf:type schema:CreativeWork
119 https://doi.org/10.1016/0166-218x(85)90059-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006274177
120 rdf:type schema:CreativeWork
121 https://doi.org/10.1016/0166-218x(94)90180-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021527459
122 rdf:type schema:CreativeWork
123 https://doi.org/10.1016/j.jcss.2008.10.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012670906
124 rdf:type schema:CreativeWork
125 https://doi.org/10.1017/cbo9780511814068 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098699402
126 rdf:type schema:CreativeWork
127 https://doi.org/10.1109/infcom.2003.1209237 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094988281
128 rdf:type schema:CreativeWork
129 https://doi.org/10.1109/infcom.2003.1209243 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093802344
130 rdf:type schema:CreativeWork
131 https://doi.org/10.1109/infcom.2007.156 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093870808
132 rdf:type schema:CreativeWork
133 https://doi.org/10.1109/infcom.2009.5062132 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095388734
134 rdf:type schema:CreativeWork
135 https://doi.org/10.1109/ipdps.2009.5160986 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095796890
136 rdf:type schema:CreativeWork
137 https://doi.org/10.1109/sfcs.2002.1181971 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095825703
138 rdf:type schema:CreativeWork
139 https://doi.org/10.1109/tnet.2002.801403 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061714307
140 rdf:type schema:CreativeWork
141 https://doi.org/10.1109/tnet.2007.892880 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061714760
142 rdf:type schema:CreativeWork
143 https://doi.org/10.1109/tpds.2006.85 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061753032
144 rdf:type schema:CreativeWork
145 https://doi.org/10.1137/0147013 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062840489
146 rdf:type schema:CreativeWork
147 https://doi.org/10.1137/090756053 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062856216
148 rdf:type schema:CreativeWork
149 https://doi.org/10.1145/1039488.1039491 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036935284
150 rdf:type schema:CreativeWork
151 https://doi.org/10.1145/43921.43922 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028661815
152 rdf:type schema:CreativeWork
153 https://doi.org/10.1145/514191.514206 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013143281
154 rdf:type schema:CreativeWork
155 https://doi.org/10.1214/07-aap470 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064389538
156 rdf:type schema:CreativeWork
157 https://www.grid.ac/institutes/grid.7452.4 schema:alternateName Paris Diderot University
158 schema:name Laboratoire LIAFA, CNRS and University Paris Diderot, 75205, Paris Cedex 13, France
159 rdf:type schema:Organization
160 https://www.grid.ac/institutes/grid.8404.8 schema:alternateName University of Florence
161 schema:name Dipartimento di Sistemi e Informatica, University of Florence, 50134, Florence, Italy
162 rdf:type schema:Organization
 




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


...