The parity hamiltonian cycle problem in directed graphs

Hiroshi Nishiyama; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita

doi:10.1007/978-3-319-45587-7_5

The parity hamiltonian cycle problem in directed graphs

Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

1 被引用数 (Scopus)

抄録

This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).

本文言語	英語
ホスト出版物のタイトル	Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers
編集者	Satoru Fujishige, Ridha A. Mahjoub, Raffaele Cerulli
出版社	Springer Verlag
ページ	50-58
ページ数	9
ISBN（印刷版）	9783319455860
DOI	https://doi.org/10.1007/978-3-319-45587-7_5
出版ステータス	出版済み - 1 1 2016
イベント	4th International Symposium on Combinatorial Optimization, ISCO 2016 - Vietri sul Mare, イタリア継続期間: 5 16 2016 → 5 18 2016

出版物シリーズ

名前	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
巻	9849 LNCS
ISSN（印刷版）	0302-9743
ISSN（電子版）	1611-3349

その他

その他	4th International Symposium on Combinatorial Optimization, ISCO 2016
Country	イタリア
City	Vietri sul Mare
Period	5/16/16 → 5/18/16

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

文献へのアクセス

10.1007/978-3-319-45587-7_5

フィンガープリント「The parity hamiltonian cycle problem in directed graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

Nishiyama, H., Yamauchi, Y., Kijima, S., & Yamashita, M. (2016). The parity hamiltonian cycle problem in directed graphs. In S. Fujishige, R. A. Mahjoub, & R. Cerulli (Eds.), Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers (pp. 50-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9849 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-45587-7_5

The parity hamiltonian cycle problem in directed graphs. / Nishiyama, Hiroshi ; Yamauchi, Yukiko ; Kijima, Shuji; Yamashita, Masafumi.

Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. ed. / Satoru Fujishige; Ridha A. Mahjoub; Raffaele Cerulli. Springer Verlag, 2016. p. 50-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9849 LNCS).

研究成果: Chapter in Book/Report/Conference proceeding › Conference contribution

Nishiyama, H , Yamauchi, Y , Kijima, S & Yamashita, M 2016, The parity hamiltonian cycle problem in directed graphs. in S Fujishige, RA Mahjoub & R Cerulli (eds), Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9849 LNCS, Springer Verlag, pp. 50-58, 4th International Symposium on Combinatorial Optimization, ISCO 2016, Vietri sul Mare, イタリア, 5/16/16. https://doi.org/10.1007/978-3-319-45587-7_5

Nishiyama H , Yamauchi Y , Kijima S, Yamashita M. The parity hamiltonian cycle problem in directed graphs. In Fujishige S, Mahjoub RA, Cerulli R, editors, Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. Springer Verlag. 2016. p. 50-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-45587-7_5

Nishiyama, Hiroshi ; Yamauchi, Yukiko ; Kijima, Shuji ; Yamashita, Masafumi. / The parity hamiltonian cycle problem in directed graphs. Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers. editor / Satoru Fujishige ; Ridha A. Mahjoub ; Raffaele Cerulli. Springer Verlag, 2016. pp. 50-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a45c11889b834b79bb0c2da11e748a66,

title = "The parity hamiltonian cycle problem in directed graphs",

abstract = "This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).",

author = "Hiroshi Nishiyama and Yukiko Yamauchi and Shuji Kijima and Masafumi Yamashita",

year = "2016",

month = jan,

day = "1",

doi = "10.1007/978-3-319-45587-7_5",

language = "English",

isbn = "9783319455860",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "50--58",

editor = "Satoru Fujishige and Mahjoub, {Ridha A.} and Raffaele Cerulli",

booktitle = "Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers",

address = "Germany",

note = "4th International Symposium on Combinatorial Optimization, ISCO 2016 ; Conference date: 16-05-2016 Through 18-05-2016",

}

TY - GEN

T1 - The parity hamiltonian cycle problem in directed graphs

AU - Nishiyama, Hiroshi

AU - Yamauchi, Yukiko

AU - Kijima, Shuji

AU - Yamashita, Masafumi

PY - 2016/1/1

Y1 - 2016/1/1

N2 - This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).

AB - This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).

UR - http://www.scopus.com/inward/record.url?scp=84988028711&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988028711&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-45587-7_5

DO - 10.1007/978-3-319-45587-7_5

M3 - Conference contribution

AN - SCOPUS:84988028711

SN - 9783319455860

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 50

EP - 58

BT - Combinatorial Optimization - 4th International Symposium, ISCO 2016, Revised Selected Papers

A2 - Fujishige, Satoru

A2 - Mahjoub, Ridha A.

A2 - Cerulli, Raffaele

PB - Springer Verlag

T2 - 4th International Symposium on Combinatorial Optimization, ISCO 2016

Y2 - 16 May 2016 through 18 May 2016

ER -