메뉴 건너뛰기




Volumn 83, Issue 3, 2002, Pages 163-166

A note on the Consecutive Ones Submatrix problem

Author keywords

Computational complexity; Consecutive Ones Property; Consecutive Ones Submatrix

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; ERROR ANALYSIS; PROBLEM SOLVING;

EID: 0037119063     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00325-8     Document Type: Article
Times cited : (26)

References (11)
  • 7
  • 10
    • 0006087096 scopus 로고    scopus 로고
    • Doctoral Thesis, Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, CA
    • PQ-tree algorithms
    • Booth, K.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.