메뉴 건너뛰기




Volumn 209, Issue , 2006, Pages 77-90

Variations on an ordering theme with constraints

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

EID: 33845642235     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-34735-6_10     Document Type: Article
Times cited : (33)

References (12)
  • 2
    • 0342765582 scopus 로고
    • Total ordering problem
    • February
    • J. Opatrny. Total ordering problem. SIAM Journal on Computing, 8(1):111-114, February 1979.
    • (1979) SIAM Journal on Computing , vol.8 , Issue.1 , pp. 111-114
    • Opatrny, J.1
  • 3
    • 0003593943 scopus 로고    scopus 로고
    • A geometric approach to betweenness
    • November
    • B. Chor and M. Sudan. A geometric approach to betweenness. SIAM Journal on Discrete Mathematics, 11(4):511-523, November 1998.
    • (1998) SIAM Journal on Discrete Mathematics , vol.11 , Issue.4 , pp. 511-523
    • Chor, B.1    Sudan, M.2
  • 4
    • 0004631832 scopus 로고
    • Cyclic ordering is NP-complete
    • October
    • Z. Galil and N. Megiddo. Cyclic ordering is NP-complete. Theoretical Computer Science, 5(2):179-182, October 1977.
    • (1977) Theoretical Computer Science , vol.5 , Issue.2 , pp. 179-182
    • Galil, Z.1    Megiddo, N.2
  • 5
    • 0034270393 scopus 로고    scopus 로고
    • A new approach to cyclic ordering of 2D orientations using ternary relation algebras
    • September
    • A. Isli and A.G. Cohn. A new approach to cyclic ordering of 2D orientations using ternary relation algebras. Artificial Intelligence, 122(1-2):137-187, September 2000.
    • (2000) Artificial Intelligence , vol.122 , Issue.1-2 , pp. 137-187
    • Isli, A.1    Cohn, A.G.2
  • 7
    • 33845637817 scopus 로고    scopus 로고
    • Constrained ordering
    • Technical Report UIB-2005-03, Universität Ulm, December
    • W. Guttmann and M. Maucher. Constrained ordering. Technical Report UIB-2005-03, Universität Ulm, December 2005.
    • (2005)
    • Guttmann, W.1    Maucher, M.2
  • 8
    • 33746063761 scopus 로고    scopus 로고
    • Object Management Group, August
    • Object Management Group, http://www.omg.org/. UML 2.0 Superstructure Specification, August 2005.
    • (2005) UML 2.0 Superstructure Specification
  • 10
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • November
    • J.F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, November 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.11 , pp. 832-843
    • Allen, J.F.1
  • 11
    • 0029229419 scopus 로고
    • Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
    • January
    • B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1):43-66, January 1995.
    • (1995) Journal of the ACM , vol.42 , Issue.1 , pp. 43-66
    • Nebel, B.1    Bürckert, H.-J.2
  • 12
    • 4243200419 scopus 로고    scopus 로고
    • Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
    • September
    • A. Krokhin, P. Jeavons, and P. Jonsson. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. Journal of the ACM, 50(5):591-640, September 2003.
    • (2003) Journal of the ACM , vol.50 , Issue.5 , pp. 591-640
    • Krokhin, A.1    Jeavons, P.2    Jonsson, P.3


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