Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

Pettie, Seth; Deng, Xiaotie; Du, Dingzhu

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

MPS-Authors

/persons/resource/persons45187

Pettie, Seth
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Deng, Xiaotie
Max Planck Society;

Du, Dingzhu
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

引用

Pettie, S. (2005). Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time. In Algorithms and computation: 16th International Symposium, ISAAC 2005 (pp. 964-973). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-27A7-B

要旨

要旨はありません