Constructing a Map of an Anonymous Graph: Applications of Universal Sequences View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2010

AUTHORS

Jérémie Chalopin , Shantanu Das , Adrian Kosowski

ABSTRACT

We study the problem of mapping an unknown environment represented as an unlabelled undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria is to minimize the amount of information that the robot has to carry when moving from node to node in the graph. We present efficient algorithms for solving map construction using a robot that is not allowed to mark any vertex of the graph, assuming the knowledge of only an upper bound on the size of the graph. We also give universal algorithms (independent of the size of the graph) for map construction when only the starting location of the robot is marked. Our solutions apply the technique of universal exploration sequences to solve the map construction problem under various constraints. We also show how the solution can be adapted to solve other problems such as the gathering of two identical robots dispersed in an unknown graph. More... »

PAGES

119-134

References to SciGraph publications

Book

TITLE

Principles of Distributed Systems

ISBN

978-3-642-17652-4
978-3-642-17653-1

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-17653-1_10

DOI

http://dx.doi.org/10.1007/978-3-642-17653-1_10

DIMENSIONS

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


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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "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": "Laboratoire d\u2019Informatique Fondamentale de Marseille", 
          "id": "https://www.grid.ac/institutes/grid.462848.4", 
          "name": [
            "LIF, CNRS & Aix-Marseille University, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chalopin", 
        "givenName": "J\u00e9r\u00e9mie", 
        "id": "sg:person.015512567437.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015512567437.12"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratoire d\u2019Informatique Fondamentale de Marseille", 
          "id": "https://www.grid.ac/institutes/grid.462848.4", 
          "name": [
            "LIF, CNRS & Aix-Marseille University, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Das", 
        "givenName": "Shantanu", 
        "id": "sg:person.010565676065.53", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010565676065.53"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Gda\u0144sk University of Technology", 
          "id": "https://www.grid.ac/institutes/grid.6868.0", 
          "name": [
            "Gda\u0144sk University of Technology, Poland", 
            "LaBRI, INRIA Bordeaux Sud-Ouest, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kosowski", 
        "givenName": "Adrian", 
        "id": "sg:person.012660373525.05", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012660373525.05"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-642-15763-9_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002843037", 
          "https://doi.org/10.1007/978-3-642-15763-9_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-642-15763-9_25", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002843037", 
          "https://doi.org/10.1007/978-3-642-15763-9_25"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-87779-0_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009045352", 
          "https://doi.org/10.1007/978-3-540-87779-0_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-87779-0_17", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009045352", 
          "https://doi.org/10.1007/978-3-540-87779-0_17"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010742782"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1006/jagm.1999.1043", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014281330"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45414-4_3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018563200", 
          "https://doi.org/10.1007/3-540-45414-4_3"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-45414-4_3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1018563200", 
          "https://doi.org/10.1007/3-540-45414-4_3"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-24749-4_22", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019111927", 
          "https://doi.org/10.1007/978-3-540-24749-4_22"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-24749-4_22", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1019111927", 
          "https://doi.org/10.1007/978-3-540-24749-4_22"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/276698.276759", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1022410991"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0022-0000(02)00023-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1022889695"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0022-0000(02)00023-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1022889695"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1835698.1835801", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1028934550"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00224-005-1223-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029611870", 
          "https://doi.org/10.1007/s00224-005-1223-5"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1391289.1391291", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1037199442"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-61440-0_163", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1038487864", 
          "https://doi.org/10.1007/3-540-61440-0_163"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039259679"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00453-006-0074-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1039730113", 
          "https://doi.org/10.1007/s00453-006-0074-2"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0166-218x(93)e0133-j", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1043469437"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/nav.1044", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051223629"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/70.105395", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061215884"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.481599", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061217493"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s009753979732428x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062880193"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1142/s0129054110007349", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062897027"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.1978.30", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086207665"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/sfcs.1979.34", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086254113"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/1.9781611973075.3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1088801210"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icdcs.2003.1203510", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093976351"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2010", 
    "datePublishedReg": "2010-01-01", 
    "description": "We study the problem of mapping an unknown environment represented as an unlabelled undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria is to minimize the amount of information that the robot has to carry when moving from node to node in the graph. We present efficient algorithms for solving map construction using a robot that is not allowed to mark any vertex of the graph, assuming the knowledge of only an upper bound on the size of the graph. We also give universal algorithms (independent of the size of the graph) for map construction when only the starting location of the robot is marked. Our solutions apply the technique of universal exploration sequences to solve the map construction problem under various constraints. We also show how the solution can be adapted to solve other problems such as the gathering of two identical robots dispersed in an unknown graph.", 
    "editor": [
      {
        "familyName": "Lu", 
        "givenName": "Chenyang", 
        "type": "Person"
      }, 
      {
        "familyName": "Masuzawa", 
        "givenName": "Toshimitsu", 
        "type": "Person"
      }, 
      {
        "familyName": "Mosbah", 
        "givenName": "Mohamed", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-17653-1_10", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-17652-4", 
        "978-3-642-17653-1"
      ], 
      "name": "Principles of Distributed Systems", 
      "type": "Book"
    }, 
    "name": "Constructing a Map of an Anonymous Graph: Applications of Universal Sequences", 
    "pagination": "119-134", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1040509143"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-17653-1_10"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "c0f80c37c96f578ae1f1ca7fda33f1399918f862588b4fca5dec3c5ff1cafeb0"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-17653-1_10", 
      "https://app.dimensions.ai/details/publication/pub.1040509143"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T08:31", 
    "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/0000000364_0000000364/records_72839_00000000.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F978-3-642-17653-1_10"
  }
]
 

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

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

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-17653-1_10'

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

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-17653-1_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-17653-1_10'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-17653-1_10'


 

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

172 TRIPLES      23 PREDICATES      51 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-17653-1_10 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author Nf72d3ecd7658429c898e1542630f8811
4 schema:citation sg:pub.10.1007/3-540-45414-4_3
5 sg:pub.10.1007/3-540-61440-0_163
6 sg:pub.10.1007/978-3-540-24749-4_22
7 sg:pub.10.1007/978-3-540-87779-0_17
8 sg:pub.10.1007/978-3-642-15763-9_25
9 sg:pub.10.1007/s00224-005-1223-5
10 sg:pub.10.1007/s00453-006-0074-2
11 https://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8
12 https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n
13 https://doi.org/10.1002/nav.1044
14 https://doi.org/10.1006/jagm.1999.1043
15 https://doi.org/10.1016/0166-218x(93)e0133-j
16 https://doi.org/10.1016/s0022-0000(02)00023-5
17 https://doi.org/10.1109/70.105395
18 https://doi.org/10.1109/71.481599
19 https://doi.org/10.1109/icdcs.2003.1203510
20 https://doi.org/10.1109/sfcs.1978.30
21 https://doi.org/10.1109/sfcs.1979.34
22 https://doi.org/10.1137/1.9781611973075.3
23 https://doi.org/10.1137/s009753979732428x
24 https://doi.org/10.1142/s0129054110007349
25 https://doi.org/10.1145/1391289.1391291
26 https://doi.org/10.1145/1835698.1835801
27 https://doi.org/10.1145/276698.276759
28 schema:datePublished 2010
29 schema:datePublishedReg 2010-01-01
30 schema:description We study the problem of mapping an unknown environment represented as an unlabelled undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria is to minimize the amount of information that the robot has to carry when moving from node to node in the graph. We present efficient algorithms for solving map construction using a robot that is not allowed to mark any vertex of the graph, assuming the knowledge of only an upper bound on the size of the graph. We also give universal algorithms (independent of the size of the graph) for map construction when only the starting location of the robot is marked. Our solutions apply the technique of universal exploration sequences to solve the map construction problem under various constraints. We also show how the solution can be adapted to solve other problems such as the gathering of two identical robots dispersed in an unknown graph.
31 schema:editor N17bed3954a9d49059ee9aeea51576d59
32 schema:genre chapter
33 schema:inLanguage en
34 schema:isAccessibleForFree true
35 schema:isPartOf N505284f9a2a94c8eb37ad840ae0f3407
36 schema:name Constructing a Map of an Anonymous Graph: Applications of Universal Sequences
37 schema:pagination 119-134
38 schema:productId N48a40ef9b404457a8b41581092812d08
39 N5af1c5dd43214b9fbe75f4afaf6191fd
40 N91cd32abaa474ee79c6e9cb4372bc3d0
41 schema:publisher N6c52f12ed3f940d4b0b638efd3525ddf
42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040509143
43 https://doi.org/10.1007/978-3-642-17653-1_10
44 schema:sdDatePublished 2019-04-16T08:31
45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
46 schema:sdPublisher Ndd0a4a5cff3a4ced8adb8c2548b966c1
47 schema:url https://link.springer.com/10.1007%2F978-3-642-17653-1_10
48 sgo:license sg:explorer/license/
49 sgo:sdDataset chapters
50 rdf:type schema:Chapter
51 N17bed3954a9d49059ee9aeea51576d59 rdf:first Nb6409506db8d49efa4d3e1df7a84d10d
52 rdf:rest Nbe6daa65d44a48438f26fb9770f90944
53 N3085fc1793ab4f469de2923a2bc06d8c schema:familyName Mosbah
54 schema:givenName Mohamed
55 rdf:type schema:Person
56 N48a40ef9b404457a8b41581092812d08 schema:name dimensions_id
57 schema:value pub.1040509143
58 rdf:type schema:PropertyValue
59 N505284f9a2a94c8eb37ad840ae0f3407 schema:isbn 978-3-642-17652-4
60 978-3-642-17653-1
61 schema:name Principles of Distributed Systems
62 rdf:type schema:Book
63 N5af1c5dd43214b9fbe75f4afaf6191fd schema:name readcube_id
64 schema:value c0f80c37c96f578ae1f1ca7fda33f1399918f862588b4fca5dec3c5ff1cafeb0
65 rdf:type schema:PropertyValue
66 N6881a2bf5de9442888a32ab099033d8f rdf:first N3085fc1793ab4f469de2923a2bc06d8c
67 rdf:rest rdf:nil
68 N6c52f12ed3f940d4b0b638efd3525ddf schema:location Berlin, Heidelberg
69 schema:name Springer Berlin Heidelberg
70 rdf:type schema:Organisation
71 N7d7c209af04845b18794665db5b50ab7 rdf:first sg:person.012660373525.05
72 rdf:rest rdf:nil
73 N8acac72f37d54c55b3191981dcceb1b9 schema:familyName Masuzawa
74 schema:givenName Toshimitsu
75 rdf:type schema:Person
76 N91cd32abaa474ee79c6e9cb4372bc3d0 schema:name doi
77 schema:value 10.1007/978-3-642-17653-1_10
78 rdf:type schema:PropertyValue
79 N9de15950eb524288ae87e83d1f991b7c rdf:first sg:person.010565676065.53
80 rdf:rest N7d7c209af04845b18794665db5b50ab7
81 Nb6409506db8d49efa4d3e1df7a84d10d schema:familyName Lu
82 schema:givenName Chenyang
83 rdf:type schema:Person
84 Nbe6daa65d44a48438f26fb9770f90944 rdf:first N8acac72f37d54c55b3191981dcceb1b9
85 rdf:rest N6881a2bf5de9442888a32ab099033d8f
86 Ndd0a4a5cff3a4ced8adb8c2548b966c1 schema:name Springer Nature - SN SciGraph project
87 rdf:type schema:Organization
88 Nf72d3ecd7658429c898e1542630f8811 rdf:first sg:person.015512567437.12
89 rdf:rest N9de15950eb524288ae87e83d1f991b7c
90 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
91 schema:name Information and Computing Sciences
92 rdf:type schema:DefinedTerm
93 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
94 schema:name Artificial Intelligence and Image Processing
95 rdf:type schema:DefinedTerm
96 sg:person.010565676065.53 schema:affiliation https://www.grid.ac/institutes/grid.462848.4
97 schema:familyName Das
98 schema:givenName Shantanu
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010565676065.53
100 rdf:type schema:Person
101 sg:person.012660373525.05 schema:affiliation https://www.grid.ac/institutes/grid.6868.0
102 schema:familyName Kosowski
103 schema:givenName Adrian
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012660373525.05
105 rdf:type schema:Person
106 sg:person.015512567437.12 schema:affiliation https://www.grid.ac/institutes/grid.462848.4
107 schema:familyName Chalopin
108 schema:givenName Jérémie
109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015512567437.12
110 rdf:type schema:Person
111 sg:pub.10.1007/3-540-45414-4_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018563200
112 https://doi.org/10.1007/3-540-45414-4_3
113 rdf:type schema:CreativeWork
114 sg:pub.10.1007/3-540-61440-0_163 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038487864
115 https://doi.org/10.1007/3-540-61440-0_163
116 rdf:type schema:CreativeWork
117 sg:pub.10.1007/978-3-540-24749-4_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019111927
118 https://doi.org/10.1007/978-3-540-24749-4_22
119 rdf:type schema:CreativeWork
120 sg:pub.10.1007/978-3-540-87779-0_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009045352
121 https://doi.org/10.1007/978-3-540-87779-0_17
122 rdf:type schema:CreativeWork
123 sg:pub.10.1007/978-3-642-15763-9_25 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002843037
124 https://doi.org/10.1007/978-3-642-15763-9_25
125 rdf:type schema:CreativeWork
126 sg:pub.10.1007/s00224-005-1223-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029611870
127 https://doi.org/10.1007/s00224-005-1223-5
128 rdf:type schema:CreativeWork
129 sg:pub.10.1007/s00453-006-0074-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039730113
130 https://doi.org/10.1007/s00453-006-0074-2
131 rdf:type schema:CreativeWork
132 https://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010742782
133 rdf:type schema:CreativeWork
134 https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n schema:sameAs https://app.dimensions.ai/details/publication/pub.1039259679
135 rdf:type schema:CreativeWork
136 https://doi.org/10.1002/nav.1044 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051223629
137 rdf:type schema:CreativeWork
138 https://doi.org/10.1006/jagm.1999.1043 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014281330
139 rdf:type schema:CreativeWork
140 https://doi.org/10.1016/0166-218x(93)e0133-j schema:sameAs https://app.dimensions.ai/details/publication/pub.1043469437
141 rdf:type schema:CreativeWork
142 https://doi.org/10.1016/s0022-0000(02)00023-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022889695
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1109/70.105395 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061215884
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1109/71.481599 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217493
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1109/icdcs.2003.1203510 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093976351
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1109/sfcs.1978.30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086207665
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1109/sfcs.1979.34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086254113
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1137/1.9781611973075.3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1088801210
155 rdf:type schema:CreativeWork
156 https://doi.org/10.1137/s009753979732428x schema:sameAs https://app.dimensions.ai/details/publication/pub.1062880193
157 rdf:type schema:CreativeWork
158 https://doi.org/10.1142/s0129054110007349 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062897027
159 rdf:type schema:CreativeWork
160 https://doi.org/10.1145/1391289.1391291 schema:sameAs https://app.dimensions.ai/details/publication/pub.1037199442
161 rdf:type schema:CreativeWork
162 https://doi.org/10.1145/1835698.1835801 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028934550
163 rdf:type schema:CreativeWork
164 https://doi.org/10.1145/276698.276759 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022410991
165 rdf:type schema:CreativeWork
166 https://www.grid.ac/institutes/grid.462848.4 schema:alternateName Laboratoire d’Informatique Fondamentale de Marseille
167 schema:name LIF, CNRS & Aix-Marseille University, France
168 rdf:type schema:Organization
169 https://www.grid.ac/institutes/grid.6868.0 schema:alternateName Gdańsk University of Technology
170 schema:name Gdańsk University of Technology, Poland
171 LaBRI, INRIA Bordeaux Sud-Ouest, France
172 rdf:type schema:Organization
 




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


...