| Author | Guttmann, Walter | dc.contributor.author |
| Author | Maucher, Markus | dc.contributor.author |
| Date of accession | 2016-03-14T13:38:44Z | dc.date.accessioned |
| Available in OPARU since | 2016-03-14T13:38:44Z | dc.date.available |
| Year of creation | 2005 | dc.date.created |
| Abstract | We 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 |
| Language | en | dc.language.iso |
| Publisher | Universität Ulm | dc.publisher |
| License | Standard (Fassung vom 03.05.2003) | dc.rights |
| Link to license text | https://oparu.uni-ulm.de/xmlui/license_v1 | dc.rights.uri |
| Keyword | Cyclic ordering | dc.subject |
| Keyword | NP-completeness | dc.subject |
| Keyword | Topological sorting | dc.subject |
| Keyword | Total ordering | dc.subject |
| Dewey Decimal Group | DDC 004 / Data processing & computer science | dc.subject.ddc |
| LCSH | Computational complexity | dc.subject.lcsh |
| Title | Constrained ordering | dc.title |
| Resource type | Arbeitspapier | dc.type |
| DOI | http://dx.doi.org/10.18725/OPARU-354 | dc.identifier.doi |
| URN | http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-54796 | dc.identifier.urn |
| GND | Constraint <Künstliche Intelligenz> | dc.subject.gnd |
| Faculty | Fakultät für Informatik | uulm.affiliationGeneral |
| Date of activation | 2006-01-13T15:08:22Z | uulm.freischaltungVTS |
| Peer review | nein | uulm.peerReview |
| DCMI Type | Text | uulm.typeDCMI |
| VTS ID | 5479 | uulm.vtsID |
| Category | Publikationen | uulm.category |
| uulm series | Ulmer Informatik-Berichte | uulm.seriesUlmName |
| Bibliography | uulm | uulm.bibliographie |
