English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Polynomial deterministic rendezvous in arbitrary graphs

MPS-Authors

Kowalski,  Dariusz
Max Planck Society;

/persons/resource/persons44431

Fleischer,  Rudolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45637

Trippen,  Gerhard
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Kowalski, D., & Pelc, A. (2004). Polynomial deterministic rendezvous in arbitrary graphs. In Algorithms and Computation: 15th International Symposium, ISAAC 2004 (pp. 644-656). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-294A-D
Abstract
There is no abstract available