Presentation 2019-10-25
Computational Complexity of Circ1P Problem and its Algorithm
Shogo Takeuchi, Takashi Harada,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 0-1 matrix satisfies Circular Ones Property (Circ1P) when 1 or 0 in each row can be continued by reordering the columns of the matrix. Whether the 0-1 matrix satisfies Circ1P can be determined by polynomial time of the matrix size. In this paper, we show that the problem of determining whether a 0-1 matrix which does not satisfy Circ1P can be divided into submatrices which satisfy Circ1P is NP-complete and propose an algorithm for the problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) 0-1 matrix / Circular Ones Property
Paper # COMP2019-25
Date of Issue 2019-10-18 (COMP)

Conference Information
Committee COMP
Conference Date 2019/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Sapporo Campus, Hokkaido University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Toshihiro Fujito(Toyohashi Univ. of Tech.)
Vice Chair Shinichi Nakano(Gunma Univ.)
Secretary Shinichi Nakano(Kumamoto Univ)
Assistant Kazuhisa Seto(Seikei Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Computational Complexity of Circ1P Problem and its Algorithm
Sub Title (in English)
Keyword(1) 0-1 matrix
Keyword(2) Circular Ones Property
1st Author's Name Shogo Takeuchi
1st Author's Affiliation Kochi University of Technology(Kochi Univ. of Tech.)
2nd Author's Name Takashi Harada
2nd Author's Affiliation Kochi University of Technology(Kochi Univ. of Tech.)
Date 2019-10-25
Paper # COMP2019-25
Volume (vol) vol.119
Number (no) COMP-249
Page pp.pp.53-56(COMP),
#Pages 4
Date of Issue 2019-10-18 (COMP)