On the probability of rendezvous in graphs

DOI10.1002/RSA.20032MaRDI QIDQ4680409zbMATH OpenOpenAlexFDO

Authors Martin Dietzfelbinger, Hisao Tamaki

Publication date 1 June 2005

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-6B83-7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1979487
• Deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Deterministic Rendezvous in Restricted Graphs
• Rendezvous search on a graph
• On asynchronous rendezvous in general graphs
• Publication:4729111
• scientific article; zbMATH DE number 845673
• A guided tour in random intersection graphs

Cited in

(7)

• Analysis of a randomized rendezvous algorithm
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• scientific article; zbMATH DE number 1979487 (Why is no real title available?)
• Deterministic Rendezvous in Restricted Graphs
• Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
• Rendezvous search on a star graph with examination costs
• On handshakes in random graphs

This page was built for publication: On the probability of rendezvous in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680409)