WEKO3
アイテム
Applications of the Lipton and Tarjan's Planar Separator Theorem
https://ipsj.ixsq.nii.ac.jp/records/59962
https://ipsj.ixsq.nii.ac.jp/records/5996231e7112b-8771-4b1e-b672-6ee18deb2152
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0404004.pdf (626.9 kB)
|
Copyright (c) 1982 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1982-02-25 | |||||||
| タイトル | ||||||||
| タイトル | Applications of the Lipton and Tarjan's Planar Separator Theorem | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Applications of the Lipton and Tarjan's Planar Separator Theorem | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Electrical Communications Faculty of Engineering Tohoku University | ||||||||
| 著者所属 | ||||||||
| Department of Electrical Communications Faculty of Engineering Tohoku University | ||||||||
| 著者所属 | ||||||||
| Department of Electrical Communications Faculty of Engineering Tohoku University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
| 著者名 |
Norishige, Chiba
× Norishige, Chiba
|
|||||||
| 著者名(英) |
Norishige, Chiba
× Norishige, Chiba
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Using the planar separator theorem of Lipton and Tarjan we give approximation algorithms with time complexity O(n log n) and asymptotic worst-case ratio tending to 1 for the following problems on planar graphs: the maximum induced subgraph problems with respect to certain graph propertles; the maximum matching problem; and the minimum vertex over problem. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Using the planar separator theorem of Lipton and Tarjan, we give approximation algorithms with time complexity O(n log n) and asymptotic worst-case ratio tending to 1 for the following problems on planar graphs: the maximum induced subgraph problems with respect to certain graph propertles; the maximum matching problem; and the minimum vertex over problem. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 4, 号 4, p. 203-207, 発行日 1982-02-25 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
