The simultaneous consecutive ones problem

Theoretical Computer Science

Volumn 410, Issue 21-23, 2009, Pages 1986-1992

  Oswald, Marcus ^a   Reinelt, Gerhard ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

NP completeness; Simultaneous consecutive ones problem

Indexed keywords

MATRIXES; NP-COMPLETENESS; NP-HARD; SIMULTANEOUS CONSECUTIVE ONES PROBLEM;

EID: 64249093813     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.039     Document Type: Article

References (7)

1. Booth K.S., and Lueker G. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13 (1976) 335-379
2. K.S. Booth, PQ-tree algorithms, Ph.D. Thesis, University of California, Berkeley, 1975
3. T. Christof, M. Oswald, G. Reinelt, Consecutive ones and a betweenness problem in computational biology, in: Proceedings of the 6th IPCO Conference, Houston, 1998, pp. 213-228
4. R. König, G. Schramm, F. Westermann, M. Oswald, S. Sager, A. Oberthür, M. Fischer, B. Brors, G. Reinelt, R. Eils, Analyzing gene expression profiling data of neuroblastomas with signal transduction networks, Poster accepted for Annual Meeting of the International Society for Computational Biology, Detroit MI, USA, June 26-29, 2005
5. Oswald M., and Reinelt G. The weighted consecutive ones problem for a fixed number of rows or columns. Operations Research Letters 31 (2003) 350-356
6. Papadimitriou Ch.H. The NP-completeness of the bandwidth minimization problem. Computing 16 (1976) 263-270
7. Tucker A. A structure theorem for the consecutive 1's property. Journal of Combinatorial Theory B 12 (1972) 153-162