| Item type |
SIG Technical Reports(1) |
| 公開日 |
2022-01-20 |
| タイトル |
|
|
タイトル |
Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
School of Computer Science and Systems Engineering, Kyushu Institute of Technology |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属 |
|
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
School of Computer Science and Systems Engineering, Kyushu Institute of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Information Sciences, Tohoku University |
| 著者名 |
Hiroshi, Eto
Takehiro, Ito
Eiji, Miyano
Akira, Suzuki
Yuma, Tamura
|
| 著者名(英) |
Hiroshi, Eto
Takehiro, Ito
Eiji, Miyano
Akira, Suzuki
Yuma, Tamura
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2022-AL-186,
号 7,
p. 1-5,
発行日 2022-01-20
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL22186007.pdf (693.6 kB)
