| http://dbpedia.org/ontology/abstract
|
The deterministic rendezvous problem is a … The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for symmetry breaking. Typically, the robots act synchronously, though non-synchronous versions of the deterministic rendezvous problem exist.he deterministic rendezvous problem exist.
|
| http://dbpedia.org/ontology/wikiPageID
|
52549872
|
| http://dbpedia.org/ontology/wikiPageLength
|
9351
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1084051864
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory +
, http://dbpedia.org/resource/Graph_traversal +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Rendezvous_problem +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Uri_Zwick +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Symmetry_breaking +
, http://dbpedia.org/resource/Regular_graph +
, http://dbpedia.org/resource/Category:Cooperative_games +
, http://dbpedia.org/resource/Determinism +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Expand_section +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Cooperative_games +
, http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Deterministic_rendezvous_problem?oldid=1084051864&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Deterministic_rendezvous_problem +
|
| owl:sameAs |
https://global.dbpedia.org/id/2dpti +
, http://dbpedia.org/resource/Deterministic_rendezvous_problem +
, http://www.wikidata.org/entity/Q28406537 +
, http://yago-knowledge.org/resource/Deterministic_rendezvous_problem +
|
| rdfs:comment |
The deterministic rendezvous problem is a … The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for symmetry breaking. Typically, the robots act synchronously, though non-synchronous versions of the deterministic rendezvous problem exist.he deterministic rendezvous problem exist.
|
| rdfs:label |
Deterministic rendezvous problem
|
