Show simple item record

AuthorGuttmann, Walterdc.contributor.author
AuthorMaucher, Markusdc.contributor.author
Date of accession2016-03-14T13:38:44Zdc.date.accessioned
Available in OPARU since2016-03-14T13:38:44Zdc.date.available
Year of creation2005dc.date.created
AbstractWe investigate the problem of finding a total order of a finite set that satisfies various local ordering constraints. Depending on the admitted constraints, we provide an efficient algorithm or prove NP-completeness. To this end, we define a reduction technique and discuss its properties.dc.description.abstract
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
LicenseStandard (Fassung vom 03.05.2003)dc.rights
Link to license texthttps://oparu.uni-ulm.de/xmlui/license_v1dc.rights.uri
KeywordCyclic orderingdc.subject
KeywordNP-completenessdc.subject
KeywordTopological sortingdc.subject
KeywordTotal orderingdc.subject
Dewey Decimal GroupDDC 004 / Data processing & computer sciencedc.subject.ddc
LCSHComputational complexitydc.subject.lcsh
TitleConstrained orderingdc.title
Resource typeArbeitspapierdc.type
DOIhttp://dx.doi.org/10.18725/OPARU-354dc.identifier.doi
URNhttp://nbn-resolving.de/urn:nbn:de:bsz:289-vts-54796dc.identifier.urn
GNDConstraint <Künstliche Intelligenz>dc.subject.gnd
FacultyFakultät für Informatikuulm.affiliationGeneral
Date of activation2006-01-13T15:08:22Zuulm.freischaltungVTS
Peer reviewneinuulm.peerReview
DCMI TypeTextuulm.typeDCMI
VTS ID5479uulm.vtsID
CategoryPublikationenuulm.category
uulm seriesUlmer Informatik-Berichteuulm.seriesUlmName
Bibliographyuulmuulm.bibliographie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record