Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves

Mehlhorn, Kurt; Yap, Chee-Keng; Lepistö, Timo; Salomaa, Arto

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45771

Yap, Chee-Keng
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Mehlhorn, K., & Yap, C.-K. (1988). Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. In Automata, languages and programming (ICALP-88): 15th international colloquium (pp. 410-423). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-AE80-2

要旨

要旨はありません