Variations on an ordering theme with constraints

Autores
Guttmann, Walter; Maucher, Markus
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Constraints
Algorithms
total ordering
NP-completeness
betweenness
cyclic ordering
topological sorting
computational complexity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/24376
Acceder
id SEDICI_bfc7e35e98ca8fb4254e548568ab2e6e
oai_identifier_str oai:sedici.unlp.edu.ar:10915/24376
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Variations on an ordering theme with constraintsGuttmann, WalterMaucher, MarkusCiencias InformáticasConstraintsAlgorithmstotal orderingNP-completenessbetweennesscyclic orderingtopological sortingcomputational complexityWe 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 problems4th IFIP International Conference on Theoretical Computer ScienceRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/24376enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:35Zoai:sedici.unlp.edu.ar:10915/24376Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:35.755SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Variations on an ordering theme with constraints
title Variations on an ordering theme with constraints
spellingShingle Variations on an ordering theme with constraints
Guttmann, Walter
Ciencias Informáticas
Constraints
Algorithms
total ordering
NP-completeness
betweenness
cyclic ordering
topological sorting
computational complexity
title_short Variations on an ordering theme with constraints
title_full Variations on an ordering theme with constraints
title_fullStr Variations on an ordering theme with constraints
title_full_unstemmed Variations on an ordering theme with constraints
title_sort Variations on an ordering theme with constraints
dc.creator.none.fl_str_mv Guttmann, Walter
Maucher, Markus
author Guttmann, Walter
author_facet Guttmann, Walter
Maucher, Markus
author_role author
author2 Maucher, Markus
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Constraints
Algorithms
total ordering
NP-completeness
betweenness
cyclic ordering
topological sorting
computational complexity
topic Ciencias Informáticas
Constraints
Algorithms
total ordering
NP-completeness
betweenness
cyclic ordering
topological sorting
computational complexity
dc.description.none.fl_txt_mv 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
4th IFIP International Conference on Theoretical Computer Science
Red de Universidades con Carreras en Informática (RedUNCI)
description 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
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/24376
url http://sedici.unlp.edu.ar/handle/10915/24376
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34633-3
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260125523378176
score 13.13397

Publicaciones similares