An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding partial orders from unordered 0-1 data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Finding Total and Partial Orders from Data for Seriation
DS '08 Proceedings of the 11th International Conference on Discovery Science
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
A faster algorithm for finding minimum tucker submatrices
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A polynomial-time algorithm for finding a minimal conflicting set containing a given row
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Tractability results for the consecutive-ones property with multiplicity
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Consecutive ones property testing: cut or swap
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Additional PC-Tree planarity conditions
GD'04 Proceedings of the 12th international conference on Graph Drawing
On planar supports for hypergraphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
Hardness results on the gapped consecutive-ones property problem
Discrete Applied Mathematics
Machine scheduling with contiguous processing constraints
Information Processing Letters
| Hi-index | 0.00 |
A (0, 1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueker (1976, J. Comput. System Sci. 13, 335-378) designed a linear time- testing algorithm for this property based on a data structure called "PQ-trees." This procedure is quite complicated and the linear-time-amortized analysis is also rather involved. We developed an off-line linear time test for the consecutive ones property without using PQ-trees and the corresponding template matching, which makes ours considerably simpler. A simplification of the consecutive ones test will immediately simplify algorithms (and computer codes) for interval-graph and planar-graph recognition. Our approach is based on a decomposition technique that separates the rows into prime subsets, each of which admits essentially a unique column ordering that realizes the consecutive ones property. The success of this approach is based on finding a good "row ordering" to be tested iteratively.