WEKO3
アイテム
Transforming Graphs with the Same Graphic Sequence
https://ipsj.ixsq.nii.ac.jp/records/183002
https://ipsj.ixsq.nii.ac.jp/records/18300225fbca19-d3d7-4563-a06c-3aff342c7b3e
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5808016.pdf (304.7 kB)
|
Copyright (c) 2017 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2017-08-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Transforming Graphs with the Same Graphic Sequence | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Transforming Graphs with the Same Graphic Sequence | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：離散と計算の幾何・グラフ・ゲーム] graphs, degree sequence, 2-switch, graph transformation, approximation algorithm | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Department of Computer Science, The University of Texas at Dallas | ||||||||||
| 著者所属 | ||||||||||
| Department of Computer and Network Engineering, School of Informatics and Engineering, The University of Electro-Communications | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer Science, The University of Texas at Dallas | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer and Network Engineering, School of Informatics and Engineering, The University of Electro-Communications | ||||||||||
| 著者名 |
Sergey, Bereg
× Sergey, Bereg
× Hiro, Ito
|
|||||||||
| 著者名(英) |
Sergey, Bereg
× Sergey, Bereg
× Hiro, Ito
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Let G and H be two graphs with the same vertex set V. It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H. We study the problem of finding the minimum number of 2-switches for transforming G into H. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.627 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Let G and H be two graphs with the same vertex set V. It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H. We study the problem of finding the minimum number of 2-switches for transforming G into H. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.627 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 58, 号 8, 発行日 2017-08-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
