Busque entre los 167389 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-20T12:36:30Z | |
dc.date.available | 2012-11-20T12:36:30Z | |
dc.date.issued | 2006-08 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/24376 | |
dc.description.abstract | We investigate the problem of nding a total order of a nite set that satis es various local ordering constraints. Depending on the admitted constraints, we provide an e cient algorithm or prove NP-completeness. We discuss several generalisations and systematically classify the problems | en |
dc.language | en | es |
dc.subject | Constraints | es |
dc.subject | total ordering | en |
dc.subject | NP-completeness | en |
dc.subject | Algorithms | es |
dc.subject | betweenness | en |
dc.subject | cyclic ordering | en |
dc.subject | topological sorting | en |
dc.subject | computational complexity | en |
dc.title | Variations on an ordering theme with constraints | en |
dc.type | Objeto de conferencia | es |
sedici.identifier.isbn | 0-387-34633-3 | es |
sedici.creator.person | Guttmann, Walter | es |
sedici.creator.person | Maucher, Markus | es |
sedici.description.note | 4th IFIP International Conference on Theoretical Computer Science | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2006-08 | |
sedici.relation.event | 19 th IFIP World Computer Congress - WCC 2006 | es |
sedici.description.peerReview | peer-review | es |