liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Exploiting bipartiteness to identify yet another tractable subclass of CSP
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
1999 (English)In: Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP), Springer , 1999, Vol. 1713, p. 118-128Conference paper, Published paper (Refereed)
Abstract [en]

The class of constraint satisfaction problems (CSPs) over finite domains has been shown to be NP-complete, but many tractable subclasses have been identified in the literature. In this paper we are interested in restrictions on the types of constraint relations in CSP instances. By a result of Jeavons et al. we know that a key to the complexity of classes arising from such restrictions is the closure properties of the sets of relations. It has been shown that sets of relations that are closed under constant, majority, affine, or associative, commutative, and idempotent (ACI) functions yield tractable subclasses of CSP. However, it has been unknown whether other closure properties may generate tractable subclasses. In this paper we introduce a class of tractable (in fact, SL-complete) CSPs based on bipartite graphs. We show that there are members of this class that are not closed under constant, majority, affine, or ACI functions, and that it, therefore, is incomparable with previously identified classes.

Place, publisher, year, edition, pages
Springer , 1999. Vol. 1713, p. 118-128
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1713
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-49636DOI: 10.1007/978-3-540-48085-3_9OAI: oai:DiVA.org:liu-49636DiVA, id: diva2:270532
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-02-23

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Bjäreland, MarcusJonsson, Peter

Search in DiVA

By author/editor
Bjäreland, MarcusJonsson, Peter
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing LabTCSLAB - Theoretical Computer Science Laboratory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 310 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf