English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Polynomial deterministic rendezvous in arbitrary graphs

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kowalski, Dariusz1, Author
Pelc, Andrzej, Author
Fleischer, Rudolf2, Editor           
Trippen, Gerhard2, Editor           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2005-05-012004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231212
Other: Local-ID: C1256428004B93B8-CA71D8FBA0AE2DD5C1256FC400729D19-KP-ISAAC
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Hong Kong, China
Start-/End Date: 2004-12-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and Computation: 15th International Symposium, ISAAC 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 644 - 656 Identifier: ISBN: 3-540-24131-0

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3341 Sequence Number: - Start / End Page: - Identifier: -